java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX --rcfgbuilder.size.of.a.code.block SingleStatement --icfgtransformation.map.elimination.monniaux.number.of.cells 2 -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 10:02:44,380 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 10:02:44,382 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 10:02:44,398 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 10:02:44,398 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 10:02:44,399 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 10:02:44,401 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 10:02:44,402 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 10:02:44,404 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 10:02:44,405 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 10:02:44,406 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 10:02:44,406 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 10:02:44,407 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 10:02:44,408 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 10:02:44,409 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 10:02:44,410 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 10:02:44,411 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 10:02:44,413 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 10:02:44,415 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 10:02:44,417 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 10:02:44,418 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 10:02:44,419 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 10:02:44,422 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 10:02:44,422 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 10:02:44,422 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 10:02:44,423 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 10:02:44,424 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 10:02:44,425 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 10:02:44,425 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 10:02:44,426 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 10:02:44,427 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 10:02:44,427 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 10:02:44,429 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 10:02:44,429 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 10:02:44,430 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 10:02:44,430 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 10:02:44,430 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 10:02:44,431 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 10:02:44,432 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: Map elimination Monniaux: number of cells -> 2 [2019-05-23 10:02:44,462 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 10:02:44,473 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 10:02:44,476 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 10:02:44,478 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 10:02:44,478 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 10:02:44,479 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl [2019-05-23 10:02:44,479 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl' [2019-05-23 10:02:44,506 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 10:02:44,507 INFO L146 ILogger]: Walking toolchain with 5 elements. [2019-05-23 10:02:44,508 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 10:02:44,508 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 10:02:44,508 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 10:02:44,524 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,534 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,539 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 10:02:44,540 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 10:02:44,540 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 10:02:44,542 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 10:02:44,543 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 10:02:44,543 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 10:02:44,543 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 10:02:44,554 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,554 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,555 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,555 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,558 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,562 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,563 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,565 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 10:02:44,565 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 10:02:44,565 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 10:02:44,566 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 10:02:44,567 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -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:4096 -smt2 -in -t:12000 [2019-05-23 10:02:44,636 INFO L146 ILogger]: Found specification of procedure main [2019-05-23 10:02:44,637 INFO L146 ILogger]: Found implementation of procedure main [2019-05-23 10:02:44,912 INFO L146 ILogger]: Using library mode [2019-05-23 10:02:44,912 INFO L146 ILogger]: Removed 0 assume(true) statements. [2019-05-23 10:02:44,914 INFO L146 ILogger]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 10:02:44 BoogieIcfgContainer [2019-05-23 10:02:44,914 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 10:02:44,914 INFO L146 ILogger]: ------------------------IcfgTransformer---------------------------- [2019-05-23 10:02:44,915 INFO L146 ILogger]: Initializing IcfgTransformer... [2019-05-23 10:02:44,916 INFO L146 ILogger]: IcfgTransformer initialized [2019-05-23 10:02:44,919 INFO L146 ILogger]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 10:02:44" (1/1) ... [2019-05-23 10:02:44,962 INFO L146 ILogger]: L18 [2019-05-23 10:02:44,962 INFO L146 ILogger]: In Formula: (= v_main_a_1 (store v_main_a_2 v_main_p_1 5)) InVars {main_a=v_main_a_2, main_p=v_main_p_1} OutVars{main_a=v_main_a_1, main_p=v_main_p_1} AuxVars[] AssignedVars[main_a] [2019-05-23 10:02:44,963 INFO L146 ILogger]: Out Formula: (and (= v_main_a_val_0_in_1 v_main_a_val_0_out_1) v_main_a_idx_0_term_assigned_1 (or (= v_main_a_val_0_in_1 5) (not (= v_main_p_1 v_main_a_idx_0_term_1))) (or (= v_main_p_1 v_main_a_idx_0_term_1) (not v_main_a_idx_0_term_assigned_1)) (or (not v_main_a_idx_1_term_assigned_1) (= v_main_p_1 v_main_a_idx_1_term_1)) (= v_main_a_val_1_out_1 v_main_a_val_1_in_1) (or (not (= v_main_p_1 v_main_a_idx_0_term_1)) (= v_main_a_val_1_in_1 5)) (or (= v_main_a_val_0_in_1 5) (not (= v_main_p_1 v_main_a_idx_1_term_1))) v_main_a_idx_1_term_assigned_1 (or (not (= v_main_p_1 v_main_a_idx_1_term_1)) (= v_main_a_val_1_in_1 5))) InVars {main_a_val_0=v_main_a_val_0_in_1, main_a_val_1=v_main_a_val_1_in_1, main_a_idx_1=v_main_a_idx_1_term_1, main_a_idx_0=v_main_a_idx_0_term_1, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1, main_p=v_main_p_1, main_a_idx_1_bool=v_main_a_idx_1_term_assigned_1} OutVars{main_a_val_0=v_main_a_val_0_out_1, main_a_val_1=v_main_a_val_1_out_1, main_a_idx_1=v_main_a_idx_1_term_1, main_a_idx_0=v_main_a_idx_0_term_1, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1, main_p=v_main_p_1, main_a_idx_1_bool=v_main_a_idx_1_term_assigned_1} AuxVars[] AssignedVars[main_a_val_0, main_a_val_1] [2019-05-23 10:02:44,963 INFO L146 ILogger]: L19 [2019-05-23 10:02:44,973 INFO L146 ILogger]: L21 [2019-05-23 10:02:44,973 INFO L146 ILogger]: In Formula: (not (= 5 (select v_main_a_3 v_main_q_2))) InVars {main_a=v_main_a_3, main_q=v_main_q_2} OutVars{main_a=v_main_a_3, main_q=v_main_q_2} AuxVars[] AssignedVars[] [2019-05-23 10:02:44,974 INFO L146 ILogger]: Out Formula: (and (or (= v_main_a_val_1_in_2 v_v_main_a_3_aux_1) (not (= v_main_q_2 v_main_a_idx_1_term_2))) (not (= 5 v_v_main_a_3_aux_1)) (or (not (= v_main_q_2 v_main_a_idx_1_term_2)) (= v_main_a_val_0_in_2 v_v_main_a_3_aux_1)) v_main_a_idx_0_term_assigned_1 (or (not (= v_main_q_2 v_main_a_idx_0_term_2)) (= v_main_a_val_0_in_2 v_v_main_a_3_aux_1)) (or (= v_main_a_val_1_in_2 v_v_main_a_3_aux_1) (not (= v_main_q_2 v_main_a_idx_0_term_2))) v_main_a_idx_1_term_assigned_1 (or (not v_main_a_idx_0_term_assigned_1) (= v_main_q_2 v_main_a_idx_0_term_2)) (or (= v_main_q_2 v_main_a_idx_1_term_2) (not v_main_a_idx_1_term_assigned_1))) InVars {main_q=v_main_q_2, main_a_val_0=v_main_a_val_0_in_2, main_a_val_1=v_main_a_val_1_in_2, main_a_idx_1=v_main_a_idx_1_term_2, main_a_idx_0=v_main_a_idx_0_term_2, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1, main_a_idx_1_bool=v_main_a_idx_1_term_assigned_1} OutVars{main_q=v_main_q_2, main_a_val_0=v_main_a_val_0_in_2, main_a_val_1=v_main_a_val_1_in_2, main_a_idx_1=v_main_a_idx_1_term_2, main_a_idx_0=v_main_a_idx_0_term_2, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1, main_a_idx_1_bool=v_main_a_idx_1_term_assigned_1} AuxVars[v_v_main_a_3_aux_1] AssignedVars[] [2019-05-23 10:02:44,980 INFO L146 ILogger]: mainErr0ASSERT_VIOLATIONASSERT [2019-05-23 10:02:44,983 INFO L146 ILogger]: L21 [2019-05-23 10:02:44,983 INFO L146 ILogger]: In Formula: (= 5 (select v_main_a_4 v_main_q_3)) InVars {main_a=v_main_a_4, main_q=v_main_q_3} OutVars{main_a=v_main_a_4, main_q=v_main_q_3} AuxVars[] AssignedVars[] [2019-05-23 10:02:44,983 INFO L146 ILogger]: Out Formula: (and (or (not (= v_main_q_3 v_main_a_idx_1_term_3)) (= v_main_a_val_1_in_3 v_v_main_a_4_aux_1)) (or (not (= v_main_q_3 v_main_a_idx_0_term_3)) (= v_main_a_val_0_in_3 v_v_main_a_4_aux_1)) (= 5 v_v_main_a_4_aux_1) v_main_a_idx_0_term_assigned_1 (or (not v_main_a_idx_1_term_assigned_1) (= v_main_q_3 v_main_a_idx_1_term_3)) (or (not (= v_main_q_3 v_main_a_idx_1_term_3)) (= v_main_a_val_0_in_3 v_v_main_a_4_aux_1)) v_main_a_idx_1_term_assigned_1 (or (not (= v_main_q_3 v_main_a_idx_0_term_3)) (= v_main_a_val_1_in_3 v_v_main_a_4_aux_1)) (or (not v_main_a_idx_0_term_assigned_1) (= v_main_q_3 v_main_a_idx_0_term_3))) InVars {main_q=v_main_q_3, main_a_val_0=v_main_a_val_0_in_3, main_a_val_1=v_main_a_val_1_in_3, main_a_idx_1=v_main_a_idx_1_term_3, main_a_idx_0=v_main_a_idx_0_term_3, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1, main_a_idx_1_bool=v_main_a_idx_1_term_assigned_1} OutVars{main_q=v_main_q_3, main_a_val_0=v_main_a_val_0_in_3, main_a_val_1=v_main_a_val_1_in_3, main_a_idx_1=v_main_a_idx_1_term_3, main_a_idx_0=v_main_a_idx_0_term_3, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1, main_a_idx_1_bool=v_main_a_idx_1_term_assigned_1} AuxVars[v_v_main_a_4_aux_1] AssignedVars[] [2019-05-23 10:02:44,984 INFO L146 ILogger]: mainFINAL [2019-05-23 10:02:44,991 INFO L146 ILogger]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 10:02:44 BasicIcfg [2019-05-23 10:02:44,991 INFO L146 ILogger]: ------------------------ END IcfgTransformer---------------------------- [2019-05-23 10:02:44,993 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 10:02:44,993 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 10:02:44,996 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 10:02:44,996 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 10:02:44" (1/3) ... [2019-05-23 10:02:44,997 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346e8343 and model type codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 10:02:44, skipping insertion in model container [2019-05-23 10:02:44,998 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 10:02:44" (2/3) ... [2019-05-23 10:02:44,998 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346e8343 and model type codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 10:02:44, skipping insertion in model container [2019-05-23 10:02:44,998 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 10:02:44" (3/3) ... [2019-05-23 10:02:45,000 INFO L146 ILogger]: Analyzing ICFG codeblockAssertOrder01.bplME [2019-05-23 10:02:45,010 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 10:02:45,017 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 10:02:45,031 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 10:02:45,055 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 10:02:45,055 INFO L146 ILogger]: Interprodecural is true [2019-05-23 10:02:45,056 INFO L146 ILogger]: Hoare is false [2019-05-23 10:02:45,056 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 10:02:45,056 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 10:02:45,056 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 10:02:45,056 INFO L146 ILogger]: Difference is false [2019-05-23 10:02:45,056 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 10:02:45,057 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 10:02:45,072 INFO L146 ILogger]: Start isEmpty. Operand 10 states. [2019-05-23 10:02:45,080 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 7 [2019-05-23 10:02:45,081 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:45,082 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1] [2019-05-23 10:02:45,082 INFO L146 ILogger]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:45,088 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:45,088 INFO L146 ILogger]: Analyzing trace with hash 1303643269, now seen corresponding path program 1 times [2019-05-23 10:02:45,140 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:45,170 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:45,172 INFO L146 ILogger]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 10:02:45,176 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:45,224 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:45,227 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 10:02:45,228 INFO L146 ILogger]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-23 10:02:45,231 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 10:02:45,243 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 10:02:45,244 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 10:02:45,246 INFO L146 ILogger]: Start difference. First operand 10 states. Second operand 3 states. [2019-05-23 10:02:45,389 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:45,390 INFO L146 ILogger]: Finished difference Result 12 states and 12 transitions. [2019-05-23 10:02:45,397 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 10:02:45,399 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 6 [2019-05-23 10:02:45,399 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:45,423 INFO L146 ILogger]: With dead ends: 12 [2019-05-23 10:02:45,423 INFO L146 ILogger]: Without dead ends: 10 [2019-05-23 10:02:45,428 INFO L146 ILogger]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 10:02:45,468 INFO L146 ILogger]: Start minimizeSevpa. Operand 10 states. [2019-05-23 10:02:45,490 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-05-23 10:02:45,491 INFO L146 ILogger]: Start removeUnreachable. Operand 9 states. [2019-05-23 10:02:45,492 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-23 10:02:45,494 INFO L146 ILogger]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-05-23 10:02:45,494 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:45,495 INFO L146 ILogger]: Abstraction has 9 states and 9 transitions. [2019-05-23 10:02:45,495 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 10:02:45,495 INFO L146 ILogger]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-23 10:02:45,497 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 9 [2019-05-23 10:02:45,498 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:45,498 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:45,498 INFO L146 ILogger]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:45,499 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:45,499 INFO L146 ILogger]: Analyzing trace with hash 2046734115, now seen corresponding path program 1 times [2019-05-23 10:02:45,500 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:45,510 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:45,516 INFO L146 ILogger]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-23 10:02:45,517 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:45,661 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:45,662 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:45,662 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-23 10:02:45,664 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 10:02:45,665 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 10:02:45,665 INFO L146 ILogger]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 10:02:45,665 INFO L146 ILogger]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-05-23 10:02:45,810 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:45,811 INFO L146 ILogger]: Finished difference Result 12 states and 12 transitions. [2019-05-23 10:02:45,811 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 10:02:45,811 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 8 [2019-05-23 10:02:45,812 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:45,812 INFO L146 ILogger]: With dead ends: 12 [2019-05-23 10:02:45,812 INFO L146 ILogger]: Without dead ends: 12 [2019-05-23 10:02:45,813 INFO L146 ILogger]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 10:02:45,814 INFO L146 ILogger]: Start minimizeSevpa. Operand 12 states. [2019-05-23 10:02:45,815 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-05-23 10:02:45,816 INFO L146 ILogger]: Start removeUnreachable. Operand 11 states. [2019-05-23 10:02:45,816 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-05-23 10:02:45,816 INFO L146 ILogger]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-05-23 10:02:45,817 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:45,817 INFO L146 ILogger]: Abstraction has 11 states and 11 transitions. [2019-05-23 10:02:45,817 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 10:02:45,817 INFO L146 ILogger]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-23 10:02:45,818 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 11 [2019-05-23 10:02:45,818 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:45,818 INFO L146 ILogger]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:45,819 INFO L146 ILogger]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:45,819 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:45,819 INFO L146 ILogger]: Analyzing trace with hash -1102501311, now seen corresponding path program 2 times [2019-05-23 10:02:45,820 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:45,849 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:45,852 INFO L146 ILogger]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 10:02:45,854 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:45,948 INFO L146 ILogger]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:45,949 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:45,949 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 10:02:45,949 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 10:02:45,950 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 10:02:45,950 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 10:02:45,950 INFO L146 ILogger]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2019-05-23 10:02:46,012 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:46,012 INFO L146 ILogger]: Finished difference Result 14 states and 14 transitions. [2019-05-23 10:02:46,012 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 10:02:46,012 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 10 [2019-05-23 10:02:46,013 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:46,013 INFO L146 ILogger]: With dead ends: 14 [2019-05-23 10:02:46,013 INFO L146 ILogger]: Without dead ends: 14 [2019-05-23 10:02:46,014 INFO L146 ILogger]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 10:02:46,015 INFO L146 ILogger]: Start minimizeSevpa. Operand 14 states. [2019-05-23 10:02:46,018 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-05-23 10:02:46,018 INFO L146 ILogger]: Start removeUnreachable. Operand 13 states. [2019-05-23 10:02:46,020 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-05-23 10:02:46,020 INFO L146 ILogger]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-05-23 10:02:46,020 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:46,020 INFO L146 ILogger]: Abstraction has 13 states and 13 transitions. [2019-05-23 10:02:46,021 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 10:02:46,021 INFO L146 ILogger]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-23 10:02:46,022 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 13 [2019-05-23 10:02:46,033 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:46,033 INFO L146 ILogger]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:46,034 INFO L146 ILogger]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:46,034 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:46,034 INFO L146 ILogger]: Analyzing trace with hash 434197983, now seen corresponding path program 3 times [2019-05-23 10:02:46,035 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:46,053 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:46,055 INFO L146 ILogger]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-23 10:02:46,056 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:46,115 INFO L146 ILogger]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:46,115 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:46,115 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 10:02:46,116 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 10:02:46,116 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 10:02:46,116 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 10:02:46,117 INFO L146 ILogger]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-05-23 10:02:46,178 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:46,178 INFO L146 ILogger]: Finished difference Result 16 states and 16 transitions. [2019-05-23 10:02:46,179 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 10:02:46,179 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 12 [2019-05-23 10:02:46,179 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:46,180 INFO L146 ILogger]: With dead ends: 16 [2019-05-23 10:02:46,180 INFO L146 ILogger]: Without dead ends: 16 [2019-05-23 10:02:46,180 INFO L146 ILogger]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 10:02:46,181 INFO L146 ILogger]: Start minimizeSevpa. Operand 16 states. [2019-05-23 10:02:46,183 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-05-23 10:02:46,183 INFO L146 ILogger]: Start removeUnreachable. Operand 15 states. [2019-05-23 10:02:46,184 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-05-23 10:02:46,184 INFO L146 ILogger]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-05-23 10:02:46,184 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:46,184 INFO L146 ILogger]: Abstraction has 15 states and 15 transitions. [2019-05-23 10:02:46,184 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 10:02:46,184 INFO L146 ILogger]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-23 10:02:46,185 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 15 [2019-05-23 10:02:46,185 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:46,185 INFO L146 ILogger]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:46,185 INFO L146 ILogger]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:46,186 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:46,186 INFO L146 ILogger]: Analyzing trace with hash -266530307, now seen corresponding path program 4 times [2019-05-23 10:02:46,187 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:46,201 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:46,203 INFO L146 ILogger]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 10:02:46,204 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:46,439 INFO L146 ILogger]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:46,439 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:46,439 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 10:02:46,440 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 10:02:46,440 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 10:02:46,440 INFO L146 ILogger]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 10:02:46,440 INFO L146 ILogger]: Start difference. First operand 15 states and 15 transitions. Second operand 7 states. [2019-05-23 10:02:46,565 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:46,566 INFO L146 ILogger]: Finished difference Result 18 states and 18 transitions. [2019-05-23 10:02:46,566 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 10:02:46,566 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 14 [2019-05-23 10:02:46,566 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:46,567 INFO L146 ILogger]: With dead ends: 18 [2019-05-23 10:02:46,567 INFO L146 ILogger]: Without dead ends: 18 [2019-05-23 10:02:46,568 INFO L146 ILogger]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 10:02:46,568 INFO L146 ILogger]: Start minimizeSevpa. Operand 18 states. [2019-05-23 10:02:46,571 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-05-23 10:02:46,571 INFO L146 ILogger]: Start removeUnreachable. Operand 17 states. [2019-05-23 10:02:46,572 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-05-23 10:02:46,572 INFO L146 ILogger]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-05-23 10:02:46,572 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:46,572 INFO L146 ILogger]: Abstraction has 17 states and 17 transitions. [2019-05-23 10:02:46,573 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 10:02:46,573 INFO L146 ILogger]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-23 10:02:46,573 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 17 [2019-05-23 10:02:46,573 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:46,574 INFO L146 ILogger]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:46,576 INFO L146 ILogger]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:46,576 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:46,576 INFO L146 ILogger]: Analyzing trace with hash 643448475, now seen corresponding path program 5 times [2019-05-23 10:02:46,577 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:46,594 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:46,596 INFO L146 ILogger]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 10:02:46,598 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:46,790 INFO L146 ILogger]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:46,791 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:46,791 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 10:02:46,791 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 10:02:46,791 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 10:02:46,792 INFO L146 ILogger]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 10:02:46,792 INFO L146 ILogger]: Start difference. First operand 17 states and 17 transitions. Second operand 8 states. [2019-05-23 10:02:46,837 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:46,837 INFO L146 ILogger]: Finished difference Result 20 states and 20 transitions. [2019-05-23 10:02:46,837 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 10:02:46,837 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 16 [2019-05-23 10:02:46,838 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:46,838 INFO L146 ILogger]: With dead ends: 20 [2019-05-23 10:02:46,838 INFO L146 ILogger]: Without dead ends: 20 [2019-05-23 10:02:46,839 INFO L146 ILogger]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 10:02:46,839 INFO L146 ILogger]: Start minimizeSevpa. Operand 20 states. [2019-05-23 10:02:46,842 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-05-23 10:02:46,842 INFO L146 ILogger]: Start removeUnreachable. Operand 19 states. [2019-05-23 10:02:46,842 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-05-23 10:02:46,843 INFO L146 ILogger]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-05-23 10:02:46,843 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:46,843 INFO L146 ILogger]: Abstraction has 19 states and 19 transitions. [2019-05-23 10:02:46,843 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 10:02:46,843 INFO L146 ILogger]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-23 10:02:46,844 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 19 [2019-05-23 10:02:46,844 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:46,844 INFO L146 ILogger]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:46,844 INFO L146 ILogger]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:46,845 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:46,845 INFO L146 ILogger]: Analyzing trace with hash -1040270407, now seen corresponding path program 6 times [2019-05-23 10:02:46,846 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:46,862 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:46,863 INFO L146 ILogger]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 10:02:46,865 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:46,976 INFO L146 ILogger]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:46,976 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:46,977 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 10:02:46,977 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 10:02:46,977 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 10:02:46,982 INFO L146 ILogger]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 10:02:46,982 INFO L146 ILogger]: Start difference. First operand 19 states and 19 transitions. Second operand 9 states. [2019-05-23 10:02:47,038 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:47,038 INFO L146 ILogger]: Finished difference Result 22 states and 22 transitions. [2019-05-23 10:02:47,038 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 10:02:47,038 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 18 [2019-05-23 10:02:47,039 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:47,039 INFO L146 ILogger]: With dead ends: 22 [2019-05-23 10:02:47,039 INFO L146 ILogger]: Without dead ends: 22 [2019-05-23 10:02:47,040 INFO L146 ILogger]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 10:02:47,040 INFO L146 ILogger]: Start minimizeSevpa. Operand 22 states. [2019-05-23 10:02:47,042 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-05-23 10:02:47,042 INFO L146 ILogger]: Start removeUnreachable. Operand 21 states. [2019-05-23 10:02:47,043 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-23 10:02:47,043 INFO L146 ILogger]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-05-23 10:02:47,043 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:47,043 INFO L146 ILogger]: Abstraction has 21 states and 21 transitions. [2019-05-23 10:02:47,043 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 10:02:47,044 INFO L146 ILogger]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-23 10:02:47,044 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 21 [2019-05-23 10:02:47,044 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:47,044 INFO L146 ILogger]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:47,045 INFO L146 ILogger]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:47,045 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:47,045 INFO L146 ILogger]: Analyzing trace with hash 108554583, now seen corresponding path program 7 times [2019-05-23 10:02:47,046 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:47,070 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:47,071 INFO L146 ILogger]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 10:02:47,073 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:47,419 INFO L146 ILogger]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:47,419 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:47,420 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 10:02:47,420 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 10:02:47,420 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 10:02:47,421 INFO L146 ILogger]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 10:02:47,421 INFO L146 ILogger]: Start difference. First operand 21 states and 21 transitions. Second operand 10 states. [2019-05-23 10:02:47,469 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:47,469 INFO L146 ILogger]: Finished difference Result 24 states and 24 transitions. [2019-05-23 10:02:47,469 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 10:02:47,469 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 20 [2019-05-23 10:02:47,470 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:47,471 INFO L146 ILogger]: With dead ends: 24 [2019-05-23 10:02:47,471 INFO L146 ILogger]: Without dead ends: 24 [2019-05-23 10:02:47,472 INFO L146 ILogger]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 10:02:47,472 INFO L146 ILogger]: Start minimizeSevpa. Operand 24 states. [2019-05-23 10:02:47,474 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-05-23 10:02:47,475 INFO L146 ILogger]: Start removeUnreachable. Operand 23 states. [2019-05-23 10:02:47,475 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-05-23 10:02:47,476 INFO L146 ILogger]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-05-23 10:02:47,476 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:47,476 INFO L146 ILogger]: Abstraction has 23 states and 23 transitions. [2019-05-23 10:02:47,476 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 10:02:47,476 INFO L146 ILogger]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-23 10:02:47,477 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 23 [2019-05-23 10:02:47,477 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:47,477 INFO L146 ILogger]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:47,477 INFO L146 ILogger]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:47,478 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:47,478 INFO L146 ILogger]: Analyzing trace with hash 322774901, now seen corresponding path program 8 times [2019-05-23 10:02:47,479 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:47,492 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:47,493 INFO L146 ILogger]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 10:02:47,494 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:47,710 INFO L146 ILogger]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:47,711 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:47,711 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 10:02:47,711 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 10:02:47,711 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 10:02:47,712 INFO L146 ILogger]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 10:02:47,712 INFO L146 ILogger]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2019-05-23 10:02:47,780 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:47,781 INFO L146 ILogger]: Finished difference Result 26 states and 26 transitions. [2019-05-23 10:02:47,781 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 10:02:47,781 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 22 [2019-05-23 10:02:47,782 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:47,782 INFO L146 ILogger]: With dead ends: 26 [2019-05-23 10:02:47,782 INFO L146 ILogger]: Without dead ends: 26 [2019-05-23 10:02:47,783 INFO L146 ILogger]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 10:02:47,783 INFO L146 ILogger]: Start minimizeSevpa. Operand 26 states. [2019-05-23 10:02:47,785 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-05-23 10:02:47,785 INFO L146 ILogger]: Start removeUnreachable. Operand 25 states. [2019-05-23 10:02:47,786 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-05-23 10:02:47,786 INFO L146 ILogger]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-05-23 10:02:47,786 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:47,786 INFO L146 ILogger]: Abstraction has 25 states and 25 transitions. [2019-05-23 10:02:47,787 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 10:02:47,787 INFO L146 ILogger]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-23 10:02:47,787 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 25 [2019-05-23 10:02:47,788 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:47,788 INFO L146 ILogger]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:47,788 INFO L146 ILogger]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:47,788 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:47,788 INFO L146 ILogger]: Analyzing trace with hash 30070291, now seen corresponding path program 9 times [2019-05-23 10:02:47,789 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:47,802 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:47,804 INFO L146 ILogger]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 10:02:47,805 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:47,960 INFO L146 ILogger]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:47,960 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:47,960 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 10:02:47,961 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 10:02:47,961 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 10:02:47,962 INFO L146 ILogger]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 10:02:47,962 INFO L146 ILogger]: Start difference. First operand 25 states and 25 transitions. Second operand 12 states. [2019-05-23 10:02:48,044 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:48,044 INFO L146 ILogger]: Finished difference Result 28 states and 28 transitions. [2019-05-23 10:02:48,045 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 10:02:48,045 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 24 [2019-05-23 10:02:48,045 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:48,047 INFO L146 ILogger]: With dead ends: 28 [2019-05-23 10:02:48,047 INFO L146 ILogger]: Without dead ends: 28 [2019-05-23 10:02:48,047 INFO L146 ILogger]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 10:02:48,047 INFO L146 ILogger]: Start minimizeSevpa. Operand 28 states. [2019-05-23 10:02:48,049 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-05-23 10:02:48,050 INFO L146 ILogger]: Start removeUnreachable. Operand 27 states. [2019-05-23 10:02:48,050 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-23 10:02:48,050 INFO L146 ILogger]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-05-23 10:02:48,051 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:48,051 INFO L146 ILogger]: Abstraction has 27 states and 27 transitions. [2019-05-23 10:02:48,051 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 10:02:48,051 INFO L146 ILogger]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-23 10:02:48,051 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 27 [2019-05-23 10:02:48,052 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:48,052 INFO L146 ILogger]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:48,052 INFO L146 ILogger]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:48,052 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:48,052 INFO L146 ILogger]: Analyzing trace with hash -2086185679, now seen corresponding path program 10 times [2019-05-23 10:02:48,053 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:48,065 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:48,067 INFO L146 ILogger]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 10:02:48,068 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:48,262 INFO L146 ILogger]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:48,263 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:48,263 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 10:02:48,264 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 10:02:48,264 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 10:02:48,265 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 10:02:48,265 INFO L146 ILogger]: Start difference. First operand 27 states and 27 transitions. Second operand 13 states. [2019-05-23 10:02:48,324 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:48,324 INFO L146 ILogger]: Finished difference Result 30 states and 30 transitions. [2019-05-23 10:02:48,325 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 10:02:48,325 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 26 [2019-05-23 10:02:48,326 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:48,326 INFO L146 ILogger]: With dead ends: 30 [2019-05-23 10:02:48,327 INFO L146 ILogger]: Without dead ends: 30 [2019-05-23 10:02:48,327 INFO L146 ILogger]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 10:02:48,328 INFO L146 ILogger]: Start minimizeSevpa. Operand 30 states. [2019-05-23 10:02:48,330 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-05-23 10:02:48,330 INFO L146 ILogger]: Start removeUnreachable. Operand 29 states. [2019-05-23 10:02:48,331 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-05-23 10:02:48,331 INFO L146 ILogger]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-05-23 10:02:48,331 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:48,331 INFO L146 ILogger]: Abstraction has 29 states and 29 transitions. [2019-05-23 10:02:48,331 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 10:02:48,332 INFO L146 ILogger]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-23 10:02:48,332 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 29 [2019-05-23 10:02:48,332 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:48,332 INFO L146 ILogger]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:48,333 INFO L146 ILogger]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:48,333 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:48,333 INFO L146 ILogger]: Analyzing trace with hash 6325455, now seen corresponding path program 11 times [2019-05-23 10:02:48,334 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:48,351 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:48,354 INFO L146 ILogger]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-23 10:02:48,358 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:48,495 INFO L146 ILogger]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:48,496 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:48,496 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 10:02:48,496 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 10:02:48,497 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 10:02:48,497 INFO L146 ILogger]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 10:02:48,497 INFO L146 ILogger]: Start difference. First operand 29 states and 29 transitions. Second operand 14 states. [2019-05-23 10:02:48,830 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:48,831 INFO L146 ILogger]: Finished difference Result 32 states and 32 transitions. [2019-05-23 10:02:48,831 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 10:02:48,831 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 28 [2019-05-23 10:02:48,831 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:48,832 INFO L146 ILogger]: With dead ends: 32 [2019-05-23 10:02:48,832 INFO L146 ILogger]: Without dead ends: 32 [2019-05-23 10:02:48,832 INFO L146 ILogger]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 10:02:48,833 INFO L146 ILogger]: Start minimizeSevpa. Operand 32 states. [2019-05-23 10:02:48,835 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-05-23 10:02:48,835 INFO L146 ILogger]: Start removeUnreachable. Operand 31 states. [2019-05-23 10:02:48,836 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-05-23 10:02:48,836 INFO L146 ILogger]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-05-23 10:02:48,836 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:48,836 INFO L146 ILogger]: Abstraction has 31 states and 31 transitions. [2019-05-23 10:02:48,836 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 10:02:48,837 INFO L146 ILogger]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-23 10:02:48,837 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 31 [2019-05-23 10:02:48,838 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:48,838 INFO L146 ILogger]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:48,838 INFO L146 ILogger]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:48,838 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:48,838 INFO L146 ILogger]: Analyzing trace with hash 864830701, now seen corresponding path program 12 times [2019-05-23 10:02:48,839 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:48,862 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:48,865 INFO L146 ILogger]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 10:02:48,867 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:49,144 INFO L146 ILogger]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:49,144 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:49,144 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 10:02:49,145 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 10:02:49,145 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 10:02:49,145 INFO L146 ILogger]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 10:02:49,145 INFO L146 ILogger]: Start difference. First operand 31 states and 31 transitions. Second operand 15 states. [2019-05-23 10:02:49,208 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:49,208 INFO L146 ILogger]: Finished difference Result 34 states and 34 transitions. [2019-05-23 10:02:49,208 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 10:02:49,208 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 30 [2019-05-23 10:02:49,209 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:49,209 INFO L146 ILogger]: With dead ends: 34 [2019-05-23 10:02:49,210 INFO L146 ILogger]: Without dead ends: 34 [2019-05-23 10:02:49,211 INFO L146 ILogger]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 10:02:49,211 INFO L146 ILogger]: Start minimizeSevpa. Operand 34 states. [2019-05-23 10:02:49,215 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-05-23 10:02:49,216 INFO L146 ILogger]: Start removeUnreachable. Operand 33 states. [2019-05-23 10:02:49,216 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-23 10:02:49,216 INFO L146 ILogger]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-05-23 10:02:49,217 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:49,217 INFO L146 ILogger]: Abstraction has 33 states and 33 transitions. [2019-05-23 10:02:49,217 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 10:02:49,217 INFO L146 ILogger]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-23 10:02:49,218 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 33 [2019-05-23 10:02:49,218 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:49,218 INFO L146 ILogger]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:49,218 INFO L146 ILogger]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:49,218 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:49,219 INFO L146 ILogger]: Analyzing trace with hash 1254651275, now seen corresponding path program 13 times [2019-05-23 10:02:49,219 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:49,243 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:49,245 INFO L146 ILogger]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 10:02:49,247 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:49,416 INFO L146 ILogger]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:49,416 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:49,416 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 10:02:49,416 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 10:02:49,417 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 10:02:49,417 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 10:02:49,417 INFO L146 ILogger]: Start difference. First operand 33 states and 33 transitions. Second operand 16 states. [2019-05-23 10:02:49,481 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:49,481 INFO L146 ILogger]: Finished difference Result 36 states and 36 transitions. [2019-05-23 10:02:49,481 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 10:02:49,481 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 32 [2019-05-23 10:02:49,481 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:49,482 INFO L146 ILogger]: With dead ends: 36 [2019-05-23 10:02:49,482 INFO L146 ILogger]: Without dead ends: 36 [2019-05-23 10:02:49,482 INFO L146 ILogger]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 10:02:49,483 INFO L146 ILogger]: Start minimizeSevpa. Operand 36 states. [2019-05-23 10:02:49,484 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-05-23 10:02:49,485 INFO L146 ILogger]: Start removeUnreachable. Operand 35 states. [2019-05-23 10:02:49,485 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-05-23 10:02:49,485 INFO L146 ILogger]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-05-23 10:02:49,485 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:49,486 INFO L146 ILogger]: Abstraction has 35 states and 35 transitions. [2019-05-23 10:02:49,486 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 10:02:49,486 INFO L146 ILogger]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-23 10:02:49,487 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 35 [2019-05-23 10:02:49,487 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:49,487 INFO L146 ILogger]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:49,487 INFO L146 ILogger]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:49,487 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:49,487 INFO L146 ILogger]: Analyzing trace with hash -2084899159, now seen corresponding path program 14 times [2019-05-23 10:02:49,488 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:49,498 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:49,502 INFO L146 ILogger]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 10:02:49,503 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:49,674 INFO L146 ILogger]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:49,674 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:49,675 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 10:02:49,675 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 10:02:49,675 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 10:02:49,676 INFO L146 ILogger]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 10:02:49,676 INFO L146 ILogger]: Start difference. First operand 35 states and 35 transitions. Second operand 17 states. [2019-05-23 10:02:49,753 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:49,754 INFO L146 ILogger]: Finished difference Result 38 states and 38 transitions. [2019-05-23 10:02:49,754 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 10:02:49,754 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 34 [2019-05-23 10:02:49,754 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:49,755 INFO L146 ILogger]: With dead ends: 38 [2019-05-23 10:02:49,755 INFO L146 ILogger]: Without dead ends: 38 [2019-05-23 10:02:49,756 INFO L146 ILogger]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 10:02:49,756 INFO L146 ILogger]: Start minimizeSevpa. Operand 38 states. [2019-05-23 10:02:49,761 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-05-23 10:02:49,761 INFO L146 ILogger]: Start removeUnreachable. Operand 37 states. [2019-05-23 10:02:49,762 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-05-23 10:02:49,762 INFO L146 ILogger]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-05-23 10:02:49,762 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:49,762 INFO L146 ILogger]: Abstraction has 37 states and 37 transitions. [2019-05-23 10:02:49,762 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 10:02:49,763 INFO L146 ILogger]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-23 10:02:49,763 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 37 [2019-05-23 10:02:49,763 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:49,763 INFO L146 ILogger]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:49,764 INFO L146 ILogger]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:49,764 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:49,764 INFO L146 ILogger]: Analyzing trace with hash 1242671175, now seen corresponding path program 15 times [2019-05-23 10:02:49,765 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:49,775 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:49,777 INFO L146 ILogger]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-23 10:02:49,778 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:49,969 INFO L146 ILogger]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:49,969 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:49,969 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 10:02:49,970 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 10:02:49,970 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 10:02:49,971 INFO L146 ILogger]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 10:02:49,971 INFO L146 ILogger]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2019-05-23 10:02:50,042 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:50,042 INFO L146 ILogger]: Finished difference Result 40 states and 40 transitions. [2019-05-23 10:02:50,043 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 10:02:50,043 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 36 [2019-05-23 10:02:50,044 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:50,044 INFO L146 ILogger]: With dead ends: 40 [2019-05-23 10:02:50,044 INFO L146 ILogger]: Without dead ends: 40 [2019-05-23 10:02:50,045 INFO L146 ILogger]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 10:02:50,045 INFO L146 ILogger]: Start minimizeSevpa. Operand 40 states. [2019-05-23 10:02:50,049 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-05-23 10:02:50,049 INFO L146 ILogger]: Start removeUnreachable. Operand 39 states. [2019-05-23 10:02:50,050 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-05-23 10:02:50,050 INFO L146 ILogger]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-05-23 10:02:50,050 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:50,050 INFO L146 ILogger]: Abstraction has 39 states and 39 transitions. [2019-05-23 10:02:50,050 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 10:02:50,050 INFO L146 ILogger]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-23 10:02:50,051 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 39 [2019-05-23 10:02:50,051 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:50,052 INFO L146 ILogger]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:50,052 INFO L146 ILogger]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:50,052 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:50,052 INFO L146 ILogger]: Analyzing trace with hash -712873371, now seen corresponding path program 16 times [2019-05-23 10:02:50,053 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:50,065 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:50,066 INFO L146 ILogger]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 10:02:50,068 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:50,529 INFO L146 ILogger]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:50,530 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:50,530 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 10:02:50,531 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 10:02:50,531 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 10:02:50,531 INFO L146 ILogger]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 10:02:50,531 INFO L146 ILogger]: Start difference. First operand 39 states and 39 transitions. Second operand 19 states. [2019-05-23 10:02:50,608 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:50,608 INFO L146 ILogger]: Finished difference Result 42 states and 42 transitions. [2019-05-23 10:02:50,609 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 10:02:50,609 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 38 [2019-05-23 10:02:50,609 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:50,610 INFO L146 ILogger]: With dead ends: 42 [2019-05-23 10:02:50,610 INFO L146 ILogger]: Without dead ends: 42 [2019-05-23 10:02:50,611 INFO L146 ILogger]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 10:02:50,611 INFO L146 ILogger]: Start minimizeSevpa. Operand 42 states. [2019-05-23 10:02:50,614 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-05-23 10:02:50,615 INFO L146 ILogger]: Start removeUnreachable. Operand 41 states. [2019-05-23 10:02:50,615 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-05-23 10:02:50,615 INFO L146 ILogger]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-05-23 10:02:50,616 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:50,616 INFO L146 ILogger]: Abstraction has 41 states and 41 transitions. [2019-05-23 10:02:50,616 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 10:02:50,616 INFO L146 ILogger]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-23 10:02:50,617 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 41 [2019-05-23 10:02:50,617 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:50,617 INFO L146 ILogger]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:50,617 INFO L146 ILogger]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:50,618 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:50,618 INFO L146 ILogger]: Analyzing trace with hash 1204493571, now seen corresponding path program 17 times [2019-05-23 10:02:50,618 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:50,628 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:50,629 INFO L146 ILogger]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 10:02:50,631 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:51,087 INFO L146 ILogger]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:51,088 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:51,088 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 10:02:51,088 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 10:02:51,088 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 10:02:51,089 INFO L146 ILogger]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 10:02:51,089 INFO L146 ILogger]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-05-23 10:02:51,163 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:51,163 INFO L146 ILogger]: Finished difference Result 44 states and 44 transitions. [2019-05-23 10:02:51,163 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 10:02:51,164 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 40 [2019-05-23 10:02:51,164 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:51,164 INFO L146 ILogger]: With dead ends: 44 [2019-05-23 10:02:51,165 INFO L146 ILogger]: Without dead ends: 44 [2019-05-23 10:02:51,165 INFO L146 ILogger]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 10:02:51,166 INFO L146 ILogger]: Start minimizeSevpa. Operand 44 states. [2019-05-23 10:02:51,169 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-05-23 10:02:51,169 INFO L146 ILogger]: Start removeUnreachable. Operand 43 states. [2019-05-23 10:02:51,170 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-05-23 10:02:51,170 INFO L146 ILogger]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-05-23 10:02:51,170 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:51,170 INFO L146 ILogger]: Abstraction has 43 states and 43 transitions. [2019-05-23 10:02:51,170 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 10:02:51,170 INFO L146 ILogger]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-23 10:02:51,171 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 43 [2019-05-23 10:02:51,171 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:51,171 INFO L146 ILogger]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:51,172 INFO L146 ILogger]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:51,172 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:51,172 INFO L146 ILogger]: Analyzing trace with hash 1253154849, now seen corresponding path program 18 times [2019-05-23 10:02:51,173 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:51,182 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:51,184 INFO L146 ILogger]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 10:02:51,185 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:51,374 INFO L146 ILogger]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:51,374 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:51,374 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 10:02:51,375 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 10:02:51,375 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 10:02:51,375 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 10:02:51,376 INFO L146 ILogger]: Start difference. First operand 43 states and 43 transitions. Second operand 21 states. [2019-05-23 10:02:51,444 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:51,445 INFO L146 ILogger]: Finished difference Result 46 states and 46 transitions. [2019-05-23 10:02:51,445 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 10:02:51,445 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 42 [2019-05-23 10:02:51,446 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:51,446 INFO L146 ILogger]: With dead ends: 46 [2019-05-23 10:02:51,446 INFO L146 ILogger]: Without dead ends: 46 [2019-05-23 10:02:51,447 INFO L146 ILogger]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 10:02:51,447 INFO L146 ILogger]: Start minimizeSevpa. Operand 46 states. [2019-05-23 10:02:51,450 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-05-23 10:02:51,451 INFO L146 ILogger]: Start removeUnreachable. Operand 45 states. [2019-05-23 10:02:51,451 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-05-23 10:02:51,451 INFO L146 ILogger]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-05-23 10:02:51,451 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:51,452 INFO L146 ILogger]: Abstraction has 45 states and 45 transitions. [2019-05-23 10:02:51,452 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 10:02:51,452 INFO L146 ILogger]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-23 10:02:51,453 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 45 [2019-05-23 10:02:51,453 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:51,453 INFO L146 ILogger]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:51,453 INFO L146 ILogger]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:51,453 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:51,453 INFO L146 ILogger]: Analyzing trace with hash 772002751, now seen corresponding path program 19 times [2019-05-23 10:02:51,454 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:51,463 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:51,465 INFO L146 ILogger]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 10:02:51,466 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:51,750 INFO L146 ILogger]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:51,750 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:51,751 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 10:02:51,751 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 10:02:51,751 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 10:02:51,758 INFO L146 ILogger]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 10:02:51,758 INFO L146 ILogger]: Start difference. First operand 45 states and 45 transitions. Second operand 22 states. [2019-05-23 10:02:51,831 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:51,831 INFO L146 ILogger]: Finished difference Result 48 states and 48 transitions. [2019-05-23 10:02:51,832 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 10:02:51,832 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 44 [2019-05-23 10:02:51,832 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:51,833 INFO L146 ILogger]: With dead ends: 48 [2019-05-23 10:02:51,833 INFO L146 ILogger]: Without dead ends: 48 [2019-05-23 10:02:51,833 INFO L146 ILogger]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 10:02:51,834 INFO L146 ILogger]: Start minimizeSevpa. Operand 48 states. [2019-05-23 10:02:51,836 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-05-23 10:02:51,837 INFO L146 ILogger]: Start removeUnreachable. Operand 47 states. [2019-05-23 10:02:51,837 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-05-23 10:02:51,838 INFO L146 ILogger]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-05-23 10:02:51,838 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:51,838 INFO L146 ILogger]: Abstraction has 47 states and 47 transitions. [2019-05-23 10:02:51,838 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 10:02:51,838 INFO L146 ILogger]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-23 10:02:51,839 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 47 [2019-05-23 10:02:51,839 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:51,839 INFO L146 ILogger]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:51,839 INFO L146 ILogger]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:51,840 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:51,840 INFO L146 ILogger]: Analyzing trace with hash -2053662755, now seen corresponding path program 20 times [2019-05-23 10:02:51,840 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:51,850 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:51,851 INFO L146 ILogger]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 10:02:51,853 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:52,092 INFO L146 ILogger]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:52,092 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:52,092 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 10:02:52,092 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 10:02:52,093 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 10:02:52,093 INFO L146 ILogger]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 10:02:52,093 INFO L146 ILogger]: Start difference. First operand 47 states and 47 transitions. Second operand 23 states. [2019-05-23 10:02:52,261 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:52,261 INFO L146 ILogger]: Finished difference Result 50 states and 50 transitions. [2019-05-23 10:02:52,261 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 10:02:52,261 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 46 [2019-05-23 10:02:52,261 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:52,262 INFO L146 ILogger]: With dead ends: 50 [2019-05-23 10:02:52,262 INFO L146 ILogger]: Without dead ends: 50 [2019-05-23 10:02:52,262 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 10:02:52,263 INFO L146 ILogger]: Start minimizeSevpa. Operand 50 states. [2019-05-23 10:02:52,264 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-05-23 10:02:52,264 INFO L146 ILogger]: Start removeUnreachable. Operand 49 states. [2019-05-23 10:02:52,265 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-05-23 10:02:52,265 INFO L146 ILogger]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-05-23 10:02:52,265 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:52,265 INFO L146 ILogger]: Abstraction has 49 states and 49 transitions. [2019-05-23 10:02:52,266 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 10:02:52,266 INFO L146 ILogger]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-23 10:02:52,266 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 49 [2019-05-23 10:02:52,266 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:52,266 INFO L146 ILogger]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:52,266 INFO L146 ILogger]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:52,267 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:52,267 INFO L146 ILogger]: Analyzing trace with hash 1196084347, now seen corresponding path program 21 times [2019-05-23 10:02:52,267 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:52,278 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:52,279 INFO L146 ILogger]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 10:02:52,281 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:52,514 INFO L146 ILogger]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:52,514 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:52,514 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 10:02:52,514 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 10:02:52,515 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 10:02:52,515 INFO L146 ILogger]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 10:02:52,515 INFO L146 ILogger]: Start difference. First operand 49 states and 49 transitions. Second operand 24 states. [2019-05-23 10:02:52,608 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:52,608 INFO L146 ILogger]: Finished difference Result 52 states and 52 transitions. [2019-05-23 10:02:52,611 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 10:02:52,611 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 48 [2019-05-23 10:02:52,612 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:52,612 INFO L146 ILogger]: With dead ends: 52 [2019-05-23 10:02:52,612 INFO L146 ILogger]: Without dead ends: 52 [2019-05-23 10:02:52,613 INFO L146 ILogger]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 10:02:52,613 INFO L146 ILogger]: Start minimizeSevpa. Operand 52 states. [2019-05-23 10:02:52,615 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-05-23 10:02:52,615 INFO L146 ILogger]: Start removeUnreachable. Operand 51 states. [2019-05-23 10:02:52,615 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-05-23 10:02:52,615 INFO L146 ILogger]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-05-23 10:02:52,616 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:52,616 INFO L146 ILogger]: Abstraction has 51 states and 51 transitions. [2019-05-23 10:02:52,616 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 10:02:52,616 INFO L146 ILogger]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-23 10:02:52,616 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 10:02:52,617 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:52,617 INFO L146 ILogger]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:52,617 INFO L146 ILogger]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:52,617 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:52,617 INFO L146 ILogger]: Analyzing trace with hash 1761825177, now seen corresponding path program 22 times [2019-05-23 10:02:52,618 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:52,628 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:52,629 INFO L146 ILogger]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 10:02:52,631 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:53,050 INFO L146 ILogger]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:53,051 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:53,051 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 10:02:53,051 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 10:02:53,051 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 10:02:53,052 INFO L146 ILogger]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 10:02:53,052 INFO L146 ILogger]: Start difference. First operand 51 states and 51 transitions. Second operand 25 states. [2019-05-23 10:02:53,121 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:53,121 INFO L146 ILogger]: Finished difference Result 54 states and 54 transitions. [2019-05-23 10:02:53,122 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 10:02:53,122 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 50 [2019-05-23 10:02:53,122 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:53,123 INFO L146 ILogger]: With dead ends: 54 [2019-05-23 10:02:53,123 INFO L146 ILogger]: Without dead ends: 54 [2019-05-23 10:02:53,124 INFO L146 ILogger]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 10:02:53,124 INFO L146 ILogger]: Start minimizeSevpa. Operand 54 states. [2019-05-23 10:02:53,126 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-05-23 10:02:53,126 INFO L146 ILogger]: Start removeUnreachable. Operand 53 states. [2019-05-23 10:02:53,126 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-05-23 10:02:53,127 INFO L146 ILogger]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-05-23 10:02:53,127 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:53,127 INFO L146 ILogger]: Abstraction has 53 states and 53 transitions. [2019-05-23 10:02:53,127 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 10:02:53,127 INFO L146 ILogger]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-23 10:02:53,127 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 53 [2019-05-23 10:02:53,128 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:53,128 INFO L146 ILogger]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:53,128 INFO L146 ILogger]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:53,128 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:53,128 INFO L146 ILogger]: Analyzing trace with hash -22083785, now seen corresponding path program 23 times [2019-05-23 10:02:53,129 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:53,138 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:53,140 INFO L146 ILogger]: Trace formula consists of 99 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-23 10:02:53,141 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:53,951 INFO L146 ILogger]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:53,951 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:53,951 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 10:02:53,951 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 10:02:53,952 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 10:02:53,952 INFO L146 ILogger]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 10:02:53,952 INFO L146 ILogger]: Start difference. First operand 53 states and 53 transitions. Second operand 26 states. [2019-05-23 10:02:54,054 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:54,054 INFO L146 ILogger]: Finished difference Result 56 states and 56 transitions. [2019-05-23 10:02:54,054 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 10:02:54,054 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 52 [2019-05-23 10:02:54,055 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:54,055 INFO L146 ILogger]: With dead ends: 56 [2019-05-23 10:02:54,055 INFO L146 ILogger]: Without dead ends: 56 [2019-05-23 10:02:54,056 INFO L146 ILogger]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 10:02:54,056 INFO L146 ILogger]: Start minimizeSevpa. Operand 56 states. [2019-05-23 10:02:54,058 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-05-23 10:02:54,059 INFO L146 ILogger]: Start removeUnreachable. Operand 55 states. [2019-05-23 10:02:54,059 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-05-23 10:02:54,059 INFO L146 ILogger]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-05-23 10:02:54,060 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:54,060 INFO L146 ILogger]: Abstraction has 55 states and 55 transitions. [2019-05-23 10:02:54,060 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 10:02:54,060 INFO L146 ILogger]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-23 10:02:54,060 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 55 [2019-05-23 10:02:54,060 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:54,061 INFO L146 ILogger]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:54,061 INFO L146 ILogger]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:54,061 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:54,061 INFO L146 ILogger]: Analyzing trace with hash -666645163, now seen corresponding path program 24 times [2019-05-23 10:02:54,062 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:54,071 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:54,072 INFO L146 ILogger]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 10:02:54,073 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:54,629 INFO L146 ILogger]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:54,629 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:54,629 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 10:02:54,630 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 10:02:54,630 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 10:02:54,630 INFO L146 ILogger]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 10:02:54,630 INFO L146 ILogger]: Start difference. First operand 55 states and 55 transitions. Second operand 27 states. [2019-05-23 10:02:54,720 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:54,721 INFO L146 ILogger]: Finished difference Result 58 states and 58 transitions. [2019-05-23 10:02:54,721 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 10:02:54,721 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 54 [2019-05-23 10:02:54,721 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:54,721 INFO L146 ILogger]: With dead ends: 58 [2019-05-23 10:02:54,722 INFO L146 ILogger]: Without dead ends: 58 [2019-05-23 10:02:54,722 INFO L146 ILogger]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 10:02:54,722 INFO L146 ILogger]: Start minimizeSevpa. Operand 58 states. [2019-05-23 10:02:54,724 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-05-23 10:02:54,725 INFO L146 ILogger]: Start removeUnreachable. Operand 57 states. [2019-05-23 10:02:54,725 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-05-23 10:02:54,726 INFO L146 ILogger]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-05-23 10:02:54,726 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:54,726 INFO L146 ILogger]: Abstraction has 57 states and 57 transitions. [2019-05-23 10:02:54,726 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 10:02:54,726 INFO L146 ILogger]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-23 10:02:54,727 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 57 [2019-05-23 10:02:54,727 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:54,727 INFO L146 ILogger]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:54,727 INFO L146 ILogger]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:54,727 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:54,728 INFO L146 ILogger]: Analyzing trace with hash -1614838797, now seen corresponding path program 25 times [2019-05-23 10:02:54,728 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:54,738 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:54,739 INFO L146 ILogger]: Trace formula consists of 105 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 10:02:54,741 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:55,294 INFO L146 ILogger]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:55,295 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:55,295 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 10:02:55,295 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 10:02:55,295 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 10:02:55,296 INFO L146 ILogger]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 10:02:55,296 INFO L146 ILogger]: Start difference. First operand 57 states and 57 transitions. Second operand 28 states. [2019-05-23 10:02:55,467 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:55,467 INFO L146 ILogger]: Finished difference Result 60 states and 60 transitions. [2019-05-23 10:02:55,468 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 10:02:55,468 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 56 [2019-05-23 10:02:55,468 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:55,469 INFO L146 ILogger]: With dead ends: 60 [2019-05-23 10:02:55,469 INFO L146 ILogger]: Without dead ends: 60 [2019-05-23 10:02:55,470 INFO L146 ILogger]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 10:02:55,470 INFO L146 ILogger]: Start minimizeSevpa. Operand 60 states. [2019-05-23 10:02:55,472 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-05-23 10:02:55,472 INFO L146 ILogger]: Start removeUnreachable. Operand 59 states. [2019-05-23 10:02:55,473 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-05-23 10:02:55,473 INFO L146 ILogger]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-05-23 10:02:55,473 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:55,473 INFO L146 ILogger]: Abstraction has 59 states and 59 transitions. [2019-05-23 10:02:55,473 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 10:02:55,474 INFO L146 ILogger]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-23 10:02:55,474 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 10:02:55,474 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:55,474 INFO L146 ILogger]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:55,475 INFO L146 ILogger]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:55,475 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:55,475 INFO L146 ILogger]: Analyzing trace with hash 1999112977, now seen corresponding path program 26 times [2019-05-23 10:02:55,476 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:55,485 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:55,487 INFO L146 ILogger]: Trace formula consists of 108 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 10:02:55,488 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:56,384 INFO L146 ILogger]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:56,384 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:56,384 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 10:02:56,385 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 10:02:56,385 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 10:02:56,385 INFO L146 ILogger]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 10:02:56,386 INFO L146 ILogger]: Start difference. First operand 59 states and 59 transitions. Second operand 29 states. [2019-05-23 10:02:56,459 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:56,459 INFO L146 ILogger]: Finished difference Result 62 states and 62 transitions. [2019-05-23 10:02:56,459 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 10:02:56,460 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 58 [2019-05-23 10:02:56,460 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:56,460 INFO L146 ILogger]: With dead ends: 62 [2019-05-23 10:02:56,461 INFO L146 ILogger]: Without dead ends: 62 [2019-05-23 10:02:56,462 INFO L146 ILogger]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 10:02:56,462 INFO L146 ILogger]: Start minimizeSevpa. Operand 62 states. [2019-05-23 10:02:56,464 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-05-23 10:02:56,464 INFO L146 ILogger]: Start removeUnreachable. Operand 61 states. [2019-05-23 10:02:56,465 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-05-23 10:02:56,465 INFO L146 ILogger]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-05-23 10:02:56,465 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:56,465 INFO L146 ILogger]: Abstraction has 61 states and 61 transitions. [2019-05-23 10:02:56,465 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 10:02:56,465 INFO L146 ILogger]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-23 10:02:56,466 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 61 [2019-05-23 10:02:56,466 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:56,466 INFO L146 ILogger]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:56,466 INFO L146 ILogger]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:56,467 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:56,467 INFO L146 ILogger]: Analyzing trace with hash 378225327, now seen corresponding path program 27 times [2019-05-23 10:02:56,467 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:56,476 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:56,477 INFO L146 ILogger]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-23 10:02:56,479 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:56,904 INFO L146 ILogger]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:56,905 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:56,905 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 10:02:56,905 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 10:02:56,906 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 10:02:56,906 INFO L146 ILogger]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 10:02:56,906 INFO L146 ILogger]: Start difference. First operand 61 states and 61 transitions. Second operand 30 states. [2019-05-23 10:02:57,016 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:57,017 INFO L146 ILogger]: Finished difference Result 64 states and 64 transitions. [2019-05-23 10:02:57,017 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 10:02:57,017 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 60 [2019-05-23 10:02:57,017 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:57,018 INFO L146 ILogger]: With dead ends: 64 [2019-05-23 10:02:57,018 INFO L146 ILogger]: Without dead ends: 64 [2019-05-23 10:02:57,022 INFO L146 ILogger]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 10:02:57,022 INFO L146 ILogger]: Start minimizeSevpa. Operand 64 states. [2019-05-23 10:02:57,023 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-05-23 10:02:57,023 INFO L146 ILogger]: Start removeUnreachable. Operand 63 states. [2019-05-23 10:02:57,024 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-23 10:02:57,024 INFO L146 ILogger]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-05-23 10:02:57,024 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:57,024 INFO L146 ILogger]: Abstraction has 63 states and 63 transitions. [2019-05-23 10:02:57,024 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 10:02:57,024 INFO L146 ILogger]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-23 10:02:57,025 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 63 [2019-05-23 10:02:57,025 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:57,025 INFO L146 ILogger]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:57,025 INFO L146 ILogger]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:57,026 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:57,026 INFO L146 ILogger]: Analyzing trace with hash 1778322125, now seen corresponding path program 28 times [2019-05-23 10:02:57,026 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:57,035 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:57,037 INFO L146 ILogger]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 10:02:57,039 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:57,446 INFO L146 ILogger]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:57,446 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:57,446 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 10:02:57,447 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 10:02:57,447 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 10:02:57,447 INFO L146 ILogger]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 10:02:57,447 INFO L146 ILogger]: Start difference. First operand 63 states and 63 transitions. Second operand 31 states. [2019-05-23 10:02:57,635 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:57,635 INFO L146 ILogger]: Finished difference Result 66 states and 66 transitions. [2019-05-23 10:02:57,635 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 10:02:57,636 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 62 [2019-05-23 10:02:57,636 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:57,637 INFO L146 ILogger]: With dead ends: 66 [2019-05-23 10:02:57,637 INFO L146 ILogger]: Without dead ends: 66 [2019-05-23 10:02:57,638 INFO L146 ILogger]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 10:02:57,638 INFO L146 ILogger]: Start minimizeSevpa. Operand 66 states. [2019-05-23 10:02:57,640 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-05-23 10:02:57,640 INFO L146 ILogger]: Start removeUnreachable. Operand 65 states. [2019-05-23 10:02:57,640 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-05-23 10:02:57,640 INFO L146 ILogger]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-05-23 10:02:57,641 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:57,641 INFO L146 ILogger]: Abstraction has 65 states and 65 transitions. [2019-05-23 10:02:57,641 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 10:02:57,641 INFO L146 ILogger]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-23 10:02:57,641 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 65 [2019-05-23 10:02:57,641 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:57,641 INFO L146 ILogger]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:57,641 INFO L146 ILogger]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:57,642 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:57,642 INFO L146 ILogger]: Analyzing trace with hash -1348385941, now seen corresponding path program 29 times [2019-05-23 10:02:57,642 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:57,652 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:57,653 INFO L146 ILogger]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 10:02:57,654 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:58,564 INFO L146 ILogger]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:58,565 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:58,565 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 10:02:58,565 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 10:02:58,565 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 10:02:58,566 INFO L146 ILogger]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 10:02:58,566 INFO L146 ILogger]: Start difference. First operand 65 states and 65 transitions. Second operand 32 states. [2019-05-23 10:02:58,655 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:58,655 INFO L146 ILogger]: Finished difference Result 68 states and 68 transitions. [2019-05-23 10:02:58,655 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 10:02:58,656 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 64 [2019-05-23 10:02:58,656 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:58,656 INFO L146 ILogger]: With dead ends: 68 [2019-05-23 10:02:58,656 INFO L146 ILogger]: Without dead ends: 68 [2019-05-23 10:02:58,657 INFO L146 ILogger]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 10:02:58,658 INFO L146 ILogger]: Start minimizeSevpa. Operand 68 states. [2019-05-23 10:02:58,659 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-05-23 10:02:58,659 INFO L146 ILogger]: Start removeUnreachable. Operand 67 states. [2019-05-23 10:02:58,660 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-05-23 10:02:58,660 INFO L146 ILogger]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-05-23 10:02:58,660 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:58,660 INFO L146 ILogger]: Abstraction has 67 states and 67 transitions. [2019-05-23 10:02:58,660 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 10:02:58,660 INFO L146 ILogger]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-23 10:02:58,661 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 67 [2019-05-23 10:02:58,661 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:58,661 INFO L146 ILogger]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:58,661 INFO L146 ILogger]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:58,661 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:58,661 INFO L146 ILogger]: Analyzing trace with hash 362269833, now seen corresponding path program 30 times [2019-05-23 10:02:58,662 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:58,671 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:58,672 INFO L146 ILogger]: Trace formula consists of 120 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 10:02:58,673 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:59,124 INFO L146 ILogger]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:59,124 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:59,124 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 10:02:59,125 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 10:02:59,125 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 10:02:59,126 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 10:02:59,126 INFO L146 ILogger]: Start difference. First operand 67 states and 67 transitions. Second operand 33 states. [2019-05-23 10:02:59,257 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:59,258 INFO L146 ILogger]: Finished difference Result 70 states and 70 transitions. [2019-05-23 10:02:59,258 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 10:02:59,258 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 66 [2019-05-23 10:02:59,258 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:59,259 INFO L146 ILogger]: With dead ends: 70 [2019-05-23 10:02:59,259 INFO L146 ILogger]: Without dead ends: 70 [2019-05-23 10:02:59,260 INFO L146 ILogger]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 10:02:59,260 INFO L146 ILogger]: Start minimizeSevpa. Operand 70 states. [2019-05-23 10:02:59,261 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-05-23 10:02:59,261 INFO L146 ILogger]: Start removeUnreachable. Operand 69 states. [2019-05-23 10:02:59,262 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-05-23 10:02:59,262 INFO L146 ILogger]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-05-23 10:02:59,262 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:59,262 INFO L146 ILogger]: Abstraction has 69 states and 69 transitions. [2019-05-23 10:02:59,262 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 10:02:59,262 INFO L146 ILogger]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-23 10:02:59,263 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 69 [2019-05-23 10:02:59,263 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:59,263 INFO L146 ILogger]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:59,263 INFO L146 ILogger]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:59,264 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:59,264 INFO L146 ILogger]: Analyzing trace with hash -670005721, now seen corresponding path program 31 times [2019-05-23 10:02:59,264 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:59,273 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:59,274 INFO L146 ILogger]: Trace formula consists of 123 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 10:02:59,275 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:59,720 INFO L146 ILogger]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:59,721 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:59,721 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 10:02:59,721 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 10:02:59,722 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 10:02:59,722 INFO L146 ILogger]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 10:02:59,722 INFO L146 ILogger]: Start difference. First operand 69 states and 69 transitions. Second operand 34 states. [2019-05-23 10:02:59,824 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:59,824 INFO L146 ILogger]: Finished difference Result 72 states and 72 transitions. [2019-05-23 10:02:59,824 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 10:02:59,824 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 68 [2019-05-23 10:02:59,824 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:59,825 INFO L146 ILogger]: With dead ends: 72 [2019-05-23 10:02:59,825 INFO L146 ILogger]: Without dead ends: 72 [2019-05-23 10:02:59,826 INFO L146 ILogger]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 10:02:59,827 INFO L146 ILogger]: Start minimizeSevpa. Operand 72 states. [2019-05-23 10:02:59,828 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-05-23 10:02:59,828 INFO L146 ILogger]: Start removeUnreachable. Operand 71 states. [2019-05-23 10:02:59,828 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-05-23 10:02:59,829 INFO L146 ILogger]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-05-23 10:02:59,829 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:59,829 INFO L146 ILogger]: Abstraction has 71 states and 71 transitions. [2019-05-23 10:02:59,829 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 10:02:59,829 INFO L146 ILogger]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-23 10:02:59,829 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 71 [2019-05-23 10:02:59,829 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:59,830 INFO L146 ILogger]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1] [2019-05-23 10:02:59,830 INFO L146 ILogger]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:59,830 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:59,830 INFO L146 ILogger]: Analyzing trace with hash -549367739, now seen corresponding path program 32 times [2019-05-23 10:02:59,831 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:59,838 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:59,839 INFO L146 ILogger]: Trace formula consists of 126 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 10:02:59,840 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:00,314 INFO L146 ILogger]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:00,314 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:00,314 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 10:03:00,315 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 10:03:00,315 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 10:03:00,316 INFO L146 ILogger]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 10:03:00,316 INFO L146 ILogger]: Start difference. First operand 71 states and 71 transitions. Second operand 35 states. [2019-05-23 10:03:00,411 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:00,411 INFO L146 ILogger]: Finished difference Result 74 states and 74 transitions. [2019-05-23 10:03:00,411 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 10:03:00,411 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 70 [2019-05-23 10:03:00,412 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:00,412 INFO L146 ILogger]: With dead ends: 74 [2019-05-23 10:03:00,413 INFO L146 ILogger]: Without dead ends: 74 [2019-05-23 10:03:00,414 INFO L146 ILogger]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 10:03:00,414 INFO L146 ILogger]: Start minimizeSevpa. Operand 74 states. [2019-05-23 10:03:00,415 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-05-23 10:03:00,415 INFO L146 ILogger]: Start removeUnreachable. Operand 73 states. [2019-05-23 10:03:00,416 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-05-23 10:03:00,416 INFO L146 ILogger]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-05-23 10:03:00,416 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:00,416 INFO L146 ILogger]: Abstraction has 73 states and 73 transitions. [2019-05-23 10:03:00,416 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 10:03:00,416 INFO L146 ILogger]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-23 10:03:00,417 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 73 [2019-05-23 10:03:00,417 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:00,417 INFO L146 ILogger]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:00,417 INFO L146 ILogger]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:00,417 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:00,418 INFO L146 ILogger]: Analyzing trace with hash -580384029, now seen corresponding path program 33 times [2019-05-23 10:03:00,418 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:00,427 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:00,428 INFO L146 ILogger]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 10:03:00,430 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:00,874 INFO L146 ILogger]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:00,875 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:00,875 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 10:03:00,875 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 10:03:00,875 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 10:03:00,876 INFO L146 ILogger]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 10:03:00,876 INFO L146 ILogger]: Start difference. First operand 73 states and 73 transitions. Second operand 36 states. [2019-05-23 10:03:00,979 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:00,979 INFO L146 ILogger]: Finished difference Result 76 states and 76 transitions. [2019-05-23 10:03:00,980 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 10:03:00,980 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 72 [2019-05-23 10:03:00,980 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:00,981 INFO L146 ILogger]: With dead ends: 76 [2019-05-23 10:03:00,981 INFO L146 ILogger]: Without dead ends: 76 [2019-05-23 10:03:00,982 INFO L146 ILogger]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 10:03:00,982 INFO L146 ILogger]: Start minimizeSevpa. Operand 76 states. [2019-05-23 10:03:00,985 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-05-23 10:03:00,985 INFO L146 ILogger]: Start removeUnreachable. Operand 75 states. [2019-05-23 10:03:00,985 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-05-23 10:03:00,986 INFO L146 ILogger]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-05-23 10:03:00,986 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:00,986 INFO L146 ILogger]: Abstraction has 75 states and 75 transitions. [2019-05-23 10:03:00,986 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 10:03:00,986 INFO L146 ILogger]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-23 10:03:00,986 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 75 [2019-05-23 10:03:00,987 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:00,987 INFO L146 ILogger]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:00,987 INFO L146 ILogger]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:00,987 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:00,987 INFO L146 ILogger]: Analyzing trace with hash -322267647, now seen corresponding path program 34 times [2019-05-23 10:03:00,988 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:00,996 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:00,998 INFO L146 ILogger]: Trace formula consists of 132 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 10:03:00,999 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:01,670 INFO L146 ILogger]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:01,670 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:01,670 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 10:03:01,671 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 10:03:01,671 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 10:03:01,672 INFO L146 ILogger]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 10:03:01,672 INFO L146 ILogger]: Start difference. First operand 75 states and 75 transitions. Second operand 37 states. [2019-05-23 10:03:01,772 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:01,772 INFO L146 ILogger]: Finished difference Result 78 states and 78 transitions. [2019-05-23 10:03:01,772 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 10:03:01,773 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 74 [2019-05-23 10:03:01,773 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:01,773 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 10:03:01,774 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 10:03:01,774 INFO L146 ILogger]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 10:03:01,775 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 10:03:01,776 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-05-23 10:03:01,776 INFO L146 ILogger]: Start removeUnreachable. Operand 77 states. [2019-05-23 10:03:01,777 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-05-23 10:03:01,777 INFO L146 ILogger]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-05-23 10:03:01,777 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:01,777 INFO L146 ILogger]: Abstraction has 77 states and 77 transitions. [2019-05-23 10:03:01,777 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 10:03:01,777 INFO L146 ILogger]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-23 10:03:01,778 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 77 [2019-05-23 10:03:01,778 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:01,778 INFO L146 ILogger]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:01,778 INFO L146 ILogger]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:01,778 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:01,778 INFO L146 ILogger]: Analyzing trace with hash -1380527713, now seen corresponding path program 35 times [2019-05-23 10:03:01,779 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:01,788 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:01,789 INFO L146 ILogger]: Trace formula consists of 135 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-23 10:03:01,791 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:02,413 INFO L146 ILogger]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:02,413 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:02,413 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 10:03:02,413 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 10:03:02,414 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 10:03:02,414 INFO L146 ILogger]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 10:03:02,415 INFO L146 ILogger]: Start difference. First operand 77 states and 77 transitions. Second operand 38 states. [2019-05-23 10:03:02,583 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:02,584 INFO L146 ILogger]: Finished difference Result 80 states and 80 transitions. [2019-05-23 10:03:02,584 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 10:03:02,584 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 76 [2019-05-23 10:03:02,585 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:02,585 INFO L146 ILogger]: With dead ends: 80 [2019-05-23 10:03:02,585 INFO L146 ILogger]: Without dead ends: 80 [2019-05-23 10:03:02,586 INFO L146 ILogger]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 10:03:02,587 INFO L146 ILogger]: Start minimizeSevpa. Operand 80 states. [2019-05-23 10:03:02,589 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-05-23 10:03:02,589 INFO L146 ILogger]: Start removeUnreachable. Operand 79 states. [2019-05-23 10:03:02,589 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-05-23 10:03:02,590 INFO L146 ILogger]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-05-23 10:03:02,590 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:02,590 INFO L146 ILogger]: Abstraction has 79 states and 79 transitions. [2019-05-23 10:03:02,590 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 10:03:02,590 INFO L146 ILogger]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-23 10:03:02,590 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 79 [2019-05-23 10:03:02,591 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:02,591 INFO L146 ILogger]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:02,591 INFO L146 ILogger]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:02,591 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:02,591 INFO L146 ILogger]: Analyzing trace with hash -461201987, now seen corresponding path program 36 times [2019-05-23 10:03:02,592 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:02,601 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:02,602 INFO L146 ILogger]: Trace formula consists of 138 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 10:03:02,603 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:03,477 INFO L146 ILogger]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:03,478 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:03,478 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 10:03:03,478 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 10:03:03,478 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 10:03:03,479 INFO L146 ILogger]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 10:03:03,479 INFO L146 ILogger]: Start difference. First operand 79 states and 79 transitions. Second operand 39 states. [2019-05-23 10:03:03,601 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:03,601 INFO L146 ILogger]: Finished difference Result 82 states and 82 transitions. [2019-05-23 10:03:03,602 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 10:03:03,602 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 78 [2019-05-23 10:03:03,602 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:03,603 INFO L146 ILogger]: With dead ends: 82 [2019-05-23 10:03:03,603 INFO L146 ILogger]: Without dead ends: 82 [2019-05-23 10:03:03,604 INFO L146 ILogger]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 10:03:03,604 INFO L146 ILogger]: Start minimizeSevpa. Operand 82 states. [2019-05-23 10:03:03,606 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-05-23 10:03:03,606 INFO L146 ILogger]: Start removeUnreachable. Operand 81 states. [2019-05-23 10:03:03,606 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-05-23 10:03:03,606 INFO L146 ILogger]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-05-23 10:03:03,607 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:03,607 INFO L146 ILogger]: Abstraction has 81 states and 81 transitions. [2019-05-23 10:03:03,607 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 10:03:03,607 INFO L146 ILogger]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-23 10:03:03,607 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 81 [2019-05-23 10:03:03,607 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:03,608 INFO L146 ILogger]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:03,608 INFO L146 ILogger]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:03,608 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:03,608 INFO L146 ILogger]: Analyzing trace with hash -1752442277, now seen corresponding path program 37 times [2019-05-23 10:03:03,609 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:03,618 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:03,620 INFO L146 ILogger]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 10:03:03,621 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:04,319 INFO L146 ILogger]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:04,320 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:04,320 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 10:03:04,320 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 10:03:04,320 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 10:03:04,321 INFO L146 ILogger]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 10:03:04,321 INFO L146 ILogger]: Start difference. First operand 81 states and 81 transitions. Second operand 40 states. [2019-05-23 10:03:04,450 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:04,451 INFO L146 ILogger]: Finished difference Result 84 states and 84 transitions. [2019-05-23 10:03:04,451 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 10:03:04,451 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 80 [2019-05-23 10:03:04,452 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:04,452 INFO L146 ILogger]: With dead ends: 84 [2019-05-23 10:03:04,452 INFO L146 ILogger]: Without dead ends: 84 [2019-05-23 10:03:04,453 INFO L146 ILogger]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 10:03:04,454 INFO L146 ILogger]: Start minimizeSevpa. Operand 84 states. [2019-05-23 10:03:04,455 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-05-23 10:03:04,455 INFO L146 ILogger]: Start removeUnreachable. Operand 83 states. [2019-05-23 10:03:04,455 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-05-23 10:03:04,456 INFO L146 ILogger]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-05-23 10:03:04,456 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:04,456 INFO L146 ILogger]: Abstraction has 83 states and 83 transitions. [2019-05-23 10:03:04,456 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 10:03:04,456 INFO L146 ILogger]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-23 10:03:04,456 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 10:03:04,456 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:04,456 INFO L146 ILogger]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:04,457 INFO L146 ILogger]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:04,457 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:04,457 INFO L146 ILogger]: Analyzing trace with hash -1388812423, now seen corresponding path program 38 times [2019-05-23 10:03:04,457 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:04,465 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:04,467 INFO L146 ILogger]: Trace formula consists of 144 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 10:03:04,468 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:05,106 INFO L146 ILogger]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:05,106 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:05,106 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 10:03:05,107 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 10:03:05,107 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 10:03:05,107 INFO L146 ILogger]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 10:03:05,107 INFO L146 ILogger]: Start difference. First operand 83 states and 83 transitions. Second operand 41 states. [2019-05-23 10:03:05,228 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:05,228 INFO L146 ILogger]: Finished difference Result 86 states and 86 transitions. [2019-05-23 10:03:05,228 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 10:03:05,229 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 82 [2019-05-23 10:03:05,229 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:05,230 INFO L146 ILogger]: With dead ends: 86 [2019-05-23 10:03:05,230 INFO L146 ILogger]: Without dead ends: 86 [2019-05-23 10:03:05,231 INFO L146 ILogger]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 10:03:05,231 INFO L146 ILogger]: Start minimizeSevpa. Operand 86 states. [2019-05-23 10:03:05,233 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-05-23 10:03:05,233 INFO L146 ILogger]: Start removeUnreachable. Operand 85 states. [2019-05-23 10:03:05,234 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-05-23 10:03:05,234 INFO L146 ILogger]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-05-23 10:03:05,234 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:05,234 INFO L146 ILogger]: Abstraction has 85 states and 85 transitions. [2019-05-23 10:03:05,234 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 10:03:05,234 INFO L146 ILogger]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-23 10:03:05,235 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 85 [2019-05-23 10:03:05,235 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:05,235 INFO L146 ILogger]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:05,235 INFO L146 ILogger]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:05,235 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:05,235 INFO L146 ILogger]: Analyzing trace with hash 167126295, now seen corresponding path program 39 times [2019-05-23 10:03:05,236 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:05,245 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:05,246 INFO L146 ILogger]: Trace formula consists of 147 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-23 10:03:05,248 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:05,824 INFO L146 ILogger]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:05,824 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:05,824 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 10:03:05,824 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 10:03:05,825 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 10:03:05,825 INFO L146 ILogger]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 10:03:05,825 INFO L146 ILogger]: Start difference. First operand 85 states and 85 transitions. Second operand 42 states. [2019-05-23 10:03:05,936 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:05,936 INFO L146 ILogger]: Finished difference Result 88 states and 88 transitions. [2019-05-23 10:03:05,937 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 10:03:05,937 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 84 [2019-05-23 10:03:05,937 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:05,938 INFO L146 ILogger]: With dead ends: 88 [2019-05-23 10:03:05,938 INFO L146 ILogger]: Without dead ends: 88 [2019-05-23 10:03:05,939 INFO L146 ILogger]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 10:03:05,940 INFO L146 ILogger]: Start minimizeSevpa. Operand 88 states. [2019-05-23 10:03:05,941 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-05-23 10:03:05,941 INFO L146 ILogger]: Start removeUnreachable. Operand 87 states. [2019-05-23 10:03:05,942 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-05-23 10:03:05,942 INFO L146 ILogger]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-05-23 10:03:05,942 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:05,942 INFO L146 ILogger]: Abstraction has 87 states and 87 transitions. [2019-05-23 10:03:05,942 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 10:03:05,943 INFO L146 ILogger]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-23 10:03:05,943 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 87 [2019-05-23 10:03:05,943 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:05,943 INFO L146 ILogger]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:05,943 INFO L146 ILogger]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:05,944 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:05,944 INFO L146 ILogger]: Analyzing trace with hash 775615285, now seen corresponding path program 40 times [2019-05-23 10:03:05,944 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:05,954 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:05,955 INFO L146 ILogger]: Trace formula consists of 150 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 10:03:05,956 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:06,639 INFO L146 ILogger]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:06,639 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:06,639 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 10:03:06,639 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 10:03:06,640 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 10:03:06,640 INFO L146 ILogger]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 10:03:06,640 INFO L146 ILogger]: Start difference. First operand 87 states and 87 transitions. Second operand 43 states. [2019-05-23 10:03:06,814 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:06,814 INFO L146 ILogger]: Finished difference Result 90 states and 90 transitions. [2019-05-23 10:03:06,814 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 10:03:06,814 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 86 [2019-05-23 10:03:06,815 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:06,815 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 10:03:06,815 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 10:03:06,817 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 10:03:06,817 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 10:03:06,818 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-05-23 10:03:06,819 INFO L146 ILogger]: Start removeUnreachable. Operand 89 states. [2019-05-23 10:03:06,821 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-05-23 10:03:06,821 INFO L146 ILogger]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-05-23 10:03:06,821 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:06,821 INFO L146 ILogger]: Abstraction has 89 states and 89 transitions. [2019-05-23 10:03:06,821 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 10:03:06,821 INFO L146 ILogger]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-23 10:03:06,822 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 89 [2019-05-23 10:03:06,822 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:06,822 INFO L146 ILogger]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:06,822 INFO L146 ILogger]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:06,823 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:06,823 INFO L146 ILogger]: Analyzing trace with hash 1417982419, now seen corresponding path program 41 times [2019-05-23 10:03:06,823 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:06,834 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:06,835 INFO L146 ILogger]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-23 10:03:06,837 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:07,489 INFO L146 ILogger]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:07,489 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:07,489 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 10:03:07,489 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 10:03:07,490 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 10:03:07,490 INFO L146 ILogger]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 10:03:07,491 INFO L146 ILogger]: Start difference. First operand 89 states and 89 transitions. Second operand 44 states. [2019-05-23 10:03:07,626 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:07,626 INFO L146 ILogger]: Finished difference Result 92 states and 92 transitions. [2019-05-23 10:03:07,626 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 10:03:07,627 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 88 [2019-05-23 10:03:07,627 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:07,627 INFO L146 ILogger]: With dead ends: 92 [2019-05-23 10:03:07,628 INFO L146 ILogger]: Without dead ends: 92 [2019-05-23 10:03:07,629 INFO L146 ILogger]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 10:03:07,629 INFO L146 ILogger]: Start minimizeSevpa. Operand 92 states. [2019-05-23 10:03:07,630 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-05-23 10:03:07,630 INFO L146 ILogger]: Start removeUnreachable. Operand 91 states. [2019-05-23 10:03:07,630 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-05-23 10:03:07,631 INFO L146 ILogger]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-05-23 10:03:07,631 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:07,631 INFO L146 ILogger]: Abstraction has 91 states and 91 transitions. [2019-05-23 10:03:07,631 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 10:03:07,631 INFO L146 ILogger]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-23 10:03:07,631 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 91 [2019-05-23 10:03:07,631 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:07,631 INFO L146 ILogger]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:07,632 INFO L146 ILogger]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:07,632 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:07,632 INFO L146 ILogger]: Analyzing trace with hash 257507569, now seen corresponding path program 42 times [2019-05-23 10:03:07,632 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:07,641 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:07,643 INFO L146 ILogger]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 10:03:07,644 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:08,493 INFO L146 ILogger]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:08,493 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:08,493 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 10:03:08,494 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 10:03:08,494 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 10:03:08,495 INFO L146 ILogger]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 10:03:08,495 INFO L146 ILogger]: Start difference. First operand 91 states and 91 transitions. Second operand 45 states. [2019-05-23 10:03:08,611 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:08,611 INFO L146 ILogger]: Finished difference Result 94 states and 94 transitions. [2019-05-23 10:03:08,612 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 10:03:08,612 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 90 [2019-05-23 10:03:08,612 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:08,613 INFO L146 ILogger]: With dead ends: 94 [2019-05-23 10:03:08,613 INFO L146 ILogger]: Without dead ends: 94 [2019-05-23 10:03:08,614 INFO L146 ILogger]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 10:03:08,615 INFO L146 ILogger]: Start minimizeSevpa. Operand 94 states. [2019-05-23 10:03:08,616 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-05-23 10:03:08,616 INFO L146 ILogger]: Start removeUnreachable. Operand 93 states. [2019-05-23 10:03:08,617 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-23 10:03:08,617 INFO L146 ILogger]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-05-23 10:03:08,617 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:08,617 INFO L146 ILogger]: Abstraction has 93 states and 93 transitions. [2019-05-23 10:03:08,617 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 10:03:08,617 INFO L146 ILogger]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-23 10:03:08,617 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 93 [2019-05-23 10:03:08,617 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:08,618 INFO L146 ILogger]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:08,618 INFO L146 ILogger]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:08,618 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:08,618 INFO L146 ILogger]: Analyzing trace with hash 1732673679, now seen corresponding path program 43 times [2019-05-23 10:03:08,619 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:08,626 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:08,628 INFO L146 ILogger]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 10:03:08,629 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:09,325 INFO L146 ILogger]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:09,326 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:09,326 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 10:03:09,326 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 10:03:09,326 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 10:03:09,327 INFO L146 ILogger]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 10:03:09,327 INFO L146 ILogger]: Start difference. First operand 93 states and 93 transitions. Second operand 46 states. [2019-05-23 10:03:09,452 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:09,452 INFO L146 ILogger]: Finished difference Result 96 states and 96 transitions. [2019-05-23 10:03:09,453 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 10:03:09,453 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 92 [2019-05-23 10:03:09,453 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:09,454 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 10:03:09,454 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 10:03:09,455 INFO L146 ILogger]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 10:03:09,455 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 10:03:09,457 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-05-23 10:03:09,457 INFO L146 ILogger]: Start removeUnreachable. Operand 95 states. [2019-05-23 10:03:09,457 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-05-23 10:03:09,457 INFO L146 ILogger]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-05-23 10:03:09,458 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:09,458 INFO L146 ILogger]: Abstraction has 95 states and 95 transitions. [2019-05-23 10:03:09,458 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 10:03:09,458 INFO L146 ILogger]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-23 10:03:09,458 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 95 [2019-05-23 10:03:09,459 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:09,459 INFO L146 ILogger]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:09,459 INFO L146 ILogger]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:09,459 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:09,459 INFO L146 ILogger]: Analyzing trace with hash 2028097709, now seen corresponding path program 44 times [2019-05-23 10:03:09,460 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:09,469 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:09,471 INFO L146 ILogger]: Trace formula consists of 162 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 10:03:09,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:10,205 INFO L146 ILogger]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:10,205 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:10,205 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 10:03:10,206 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 10:03:10,206 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 10:03:10,207 INFO L146 ILogger]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 10:03:10,207 INFO L146 ILogger]: Start difference. First operand 95 states and 95 transitions. Second operand 47 states. [2019-05-23 10:03:10,328 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:10,328 INFO L146 ILogger]: Finished difference Result 98 states and 98 transitions. [2019-05-23 10:03:10,333 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 10:03:10,334 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 94 [2019-05-23 10:03:10,334 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:10,335 INFO L146 ILogger]: With dead ends: 98 [2019-05-23 10:03:10,335 INFO L146 ILogger]: Without dead ends: 98 [2019-05-23 10:03:10,335 INFO L146 ILogger]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 10:03:10,336 INFO L146 ILogger]: Start minimizeSevpa. Operand 98 states. [2019-05-23 10:03:10,337 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-05-23 10:03:10,337 INFO L146 ILogger]: Start removeUnreachable. Operand 97 states. [2019-05-23 10:03:10,338 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-05-23 10:03:10,338 INFO L146 ILogger]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-05-23 10:03:10,338 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:10,339 INFO L146 ILogger]: Abstraction has 97 states and 97 transitions. [2019-05-23 10:03:10,339 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 10:03:10,339 INFO L146 ILogger]: Start isEmpty. Operand 97 states and 97 transitions. [2019-05-23 10:03:10,339 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 97 [2019-05-23 10:03:10,339 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:10,340 INFO L146 ILogger]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:10,340 INFO L146 ILogger]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:10,340 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:10,340 INFO L146 ILogger]: Analyzing trace with hash -1832218293, now seen corresponding path program 45 times [2019-05-23 10:03:10,341 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:10,353 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:10,355 INFO L146 ILogger]: Trace formula consists of 165 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-23 10:03:10,357 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:11,741 INFO L146 ILogger]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:11,742 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:11,742 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 10:03:11,742 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 10:03:11,742 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 10:03:11,743 INFO L146 ILogger]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 10:03:11,743 INFO L146 ILogger]: Start difference. First operand 97 states and 97 transitions. Second operand 48 states. [2019-05-23 10:03:11,873 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:11,873 INFO L146 ILogger]: Finished difference Result 100 states and 100 transitions. [2019-05-23 10:03:11,874 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 10:03:11,874 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 96 [2019-05-23 10:03:11,874 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:11,875 INFO L146 ILogger]: With dead ends: 100 [2019-05-23 10:03:11,875 INFO L146 ILogger]: Without dead ends: 100 [2019-05-23 10:03:11,876 INFO L146 ILogger]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 10:03:11,876 INFO L146 ILogger]: Start minimizeSevpa. Operand 100 states. [2019-05-23 10:03:11,878 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-05-23 10:03:11,878 INFO L146 ILogger]: Start removeUnreachable. Operand 99 states. [2019-05-23 10:03:11,879 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-05-23 10:03:11,879 INFO L146 ILogger]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-05-23 10:03:11,879 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:11,879 INFO L146 ILogger]: Abstraction has 99 states and 99 transitions. [2019-05-23 10:03:11,879 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 10:03:11,879 INFO L146 ILogger]: Start isEmpty. Operand 99 states and 99 transitions. [2019-05-23 10:03:11,880 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 99 [2019-05-23 10:03:11,880 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:11,880 INFO L146 ILogger]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:11,880 INFO L146 ILogger]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:11,881 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:11,881 INFO L146 ILogger]: Analyzing trace with hash -744152471, now seen corresponding path program 46 times [2019-05-23 10:03:11,881 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:11,891 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:11,892 INFO L146 ILogger]: Trace formula consists of 168 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 10:03:11,894 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:12,711 INFO L146 ILogger]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:12,712 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:12,712 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 10:03:12,712 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 10:03:12,712 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 10:03:12,713 INFO L146 ILogger]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 10:03:12,713 INFO L146 ILogger]: Start difference. First operand 99 states and 99 transitions. Second operand 49 states. [2019-05-23 10:03:12,846 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:12,846 INFO L146 ILogger]: Finished difference Result 102 states and 102 transitions. [2019-05-23 10:03:12,847 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 10:03:12,847 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 98 [2019-05-23 10:03:12,847 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:12,848 INFO L146 ILogger]: With dead ends: 102 [2019-05-23 10:03:12,848 INFO L146 ILogger]: Without dead ends: 102 [2019-05-23 10:03:12,848 INFO L146 ILogger]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 10:03:12,849 INFO L146 ILogger]: Start minimizeSevpa. Operand 102 states. [2019-05-23 10:03:12,850 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-05-23 10:03:12,851 INFO L146 ILogger]: Start removeUnreachable. Operand 101 states. [2019-05-23 10:03:12,851 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-05-23 10:03:12,851 INFO L146 ILogger]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-05-23 10:03:12,851 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:12,851 INFO L146 ILogger]: Abstraction has 101 states and 101 transitions. [2019-05-23 10:03:12,851 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 10:03:12,851 INFO L146 ILogger]: Start isEmpty. Operand 101 states and 101 transitions. [2019-05-23 10:03:12,852 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 101 [2019-05-23 10:03:12,852 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:12,852 INFO L146 ILogger]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:12,852 INFO L146 ILogger]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:12,852 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:12,852 INFO L146 ILogger]: Analyzing trace with hash 1210049543, now seen corresponding path program 47 times [2019-05-23 10:03:12,854 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:12,863 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:12,865 INFO L146 ILogger]: Trace formula consists of 171 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-23 10:03:12,867 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:13,721 INFO L146 ILogger]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:13,722 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:13,722 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 10:03:13,722 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 10:03:13,722 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 10:03:13,723 INFO L146 ILogger]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 10:03:13,723 INFO L146 ILogger]: Start difference. First operand 101 states and 101 transitions. Second operand 50 states. [2019-05-23 10:03:13,879 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:13,879 INFO L146 ILogger]: Finished difference Result 104 states and 104 transitions. [2019-05-23 10:03:13,879 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 10:03:13,879 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 100 [2019-05-23 10:03:13,880 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:13,880 INFO L146 ILogger]: With dead ends: 104 [2019-05-23 10:03:13,881 INFO L146 ILogger]: Without dead ends: 104 [2019-05-23 10:03:13,881 INFO L146 ILogger]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 10:03:13,882 INFO L146 ILogger]: Start minimizeSevpa. Operand 104 states. [2019-05-23 10:03:13,884 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-05-23 10:03:13,884 INFO L146 ILogger]: Start removeUnreachable. Operand 103 states. [2019-05-23 10:03:13,884 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-05-23 10:03:13,884 INFO L146 ILogger]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-05-23 10:03:13,885 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:13,885 INFO L146 ILogger]: Abstraction has 103 states and 103 transitions. [2019-05-23 10:03:13,885 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 10:03:13,885 INFO L146 ILogger]: Start isEmpty. Operand 103 states and 103 transitions. [2019-05-23 10:03:13,885 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 103 [2019-05-23 10:03:13,886 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:13,886 INFO L146 ILogger]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:13,886 INFO L146 ILogger]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:13,886 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:13,886 INFO L146 ILogger]: Analyzing trace with hash -1997490651, now seen corresponding path program 48 times [2019-05-23 10:03:13,887 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:13,897 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:13,898 INFO L146 ILogger]: Trace formula consists of 174 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 10:03:13,900 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:14,799 INFO L146 ILogger]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:14,800 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:14,800 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 10:03:14,800 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 10:03:14,800 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 10:03:14,801 INFO L146 ILogger]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 10:03:14,801 INFO L146 ILogger]: Start difference. First operand 103 states and 103 transitions. Second operand 51 states. [2019-05-23 10:03:14,975 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:14,975 INFO L146 ILogger]: Finished difference Result 106 states and 106 transitions. [2019-05-23 10:03:14,984 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 10:03:14,984 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 102 [2019-05-23 10:03:14,984 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:14,985 INFO L146 ILogger]: With dead ends: 106 [2019-05-23 10:03:14,985 INFO L146 ILogger]: Without dead ends: 106 [2019-05-23 10:03:14,986 INFO L146 ILogger]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 10:03:14,986 INFO L146 ILogger]: Start minimizeSevpa. Operand 106 states. [2019-05-23 10:03:14,987 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-05-23 10:03:14,987 INFO L146 ILogger]: Start removeUnreachable. Operand 105 states. [2019-05-23 10:03:14,988 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-05-23 10:03:14,988 INFO L146 ILogger]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-05-23 10:03:14,988 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:14,988 INFO L146 ILogger]: Abstraction has 105 states and 105 transitions. [2019-05-23 10:03:14,988 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 10:03:14,988 INFO L146 ILogger]: Start isEmpty. Operand 105 states and 105 transitions. [2019-05-23 10:03:14,989 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 105 [2019-05-23 10:03:14,989 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:14,989 INFO L146 ILogger]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:14,989 INFO L146 ILogger]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:14,990 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:14,990 INFO L146 ILogger]: Analyzing trace with hash -657098557, now seen corresponding path program 49 times [2019-05-23 10:03:14,990 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:15,000 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:15,002 INFO L146 ILogger]: Trace formula consists of 177 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 10:03:15,003 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:15,955 INFO L146 ILogger]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:15,955 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:15,955 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 10:03:15,955 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 10:03:15,956 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 10:03:15,956 INFO L146 ILogger]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 10:03:15,956 INFO L146 ILogger]: Start difference. First operand 105 states and 105 transitions. Second operand 52 states. [2019-05-23 10:03:16,088 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:16,088 INFO L146 ILogger]: Finished difference Result 108 states and 108 transitions. [2019-05-23 10:03:16,088 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 10:03:16,089 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 104 [2019-05-23 10:03:16,089 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:16,090 INFO L146 ILogger]: With dead ends: 108 [2019-05-23 10:03:16,090 INFO L146 ILogger]: Without dead ends: 108 [2019-05-23 10:03:16,091 INFO L146 ILogger]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 10:03:16,092 INFO L146 ILogger]: Start minimizeSevpa. Operand 108 states. [2019-05-23 10:03:16,093 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-05-23 10:03:16,093 INFO L146 ILogger]: Start removeUnreachable. Operand 107 states. [2019-05-23 10:03:16,094 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-05-23 10:03:16,094 INFO L146 ILogger]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-05-23 10:03:16,094 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:16,094 INFO L146 ILogger]: Abstraction has 107 states and 107 transitions. [2019-05-23 10:03:16,094 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 10:03:16,094 INFO L146 ILogger]: Start isEmpty. Operand 107 states and 107 transitions. [2019-05-23 10:03:16,095 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 10:03:16,095 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:16,095 INFO L146 ILogger]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:16,095 INFO L146 ILogger]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:16,095 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:16,096 INFO L146 ILogger]: Analyzing trace with hash -1030485023, now seen corresponding path program 50 times [2019-05-23 10:03:16,096 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:16,106 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:16,108 INFO L146 ILogger]: Trace formula consists of 180 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 10:03:16,109 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:17,271 INFO L146 ILogger]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:17,272 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:17,272 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 10:03:17,272 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 10:03:17,273 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 10:03:17,273 INFO L146 ILogger]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 10:03:17,273 INFO L146 ILogger]: Start difference. First operand 107 states and 107 transitions. Second operand 53 states. [2019-05-23 10:03:17,521 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:17,521 INFO L146 ILogger]: Finished difference Result 110 states and 110 transitions. [2019-05-23 10:03:17,521 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 10:03:17,521 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 106 [2019-05-23 10:03:17,522 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:17,523 INFO L146 ILogger]: With dead ends: 110 [2019-05-23 10:03:17,523 INFO L146 ILogger]: Without dead ends: 110 [2019-05-23 10:03:17,524 INFO L146 ILogger]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 10:03:17,524 INFO L146 ILogger]: Start minimizeSevpa. Operand 110 states. [2019-05-23 10:03:17,525 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-05-23 10:03:17,526 INFO L146 ILogger]: Start removeUnreachable. Operand 109 states. [2019-05-23 10:03:17,526 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-05-23 10:03:17,526 INFO L146 ILogger]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-05-23 10:03:17,526 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:17,526 INFO L146 ILogger]: Abstraction has 109 states and 109 transitions. [2019-05-23 10:03:17,527 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 10:03:17,527 INFO L146 ILogger]: Start isEmpty. Operand 109 states and 109 transitions. [2019-05-23 10:03:17,527 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 109 [2019-05-23 10:03:17,527 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:17,527 INFO L146 ILogger]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:17,528 INFO L146 ILogger]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:17,528 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:17,528 INFO L146 ILogger]: Analyzing trace with hash 922374015, now seen corresponding path program 51 times [2019-05-23 10:03:17,529 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:17,540 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:17,541 INFO L146 ILogger]: Trace formula consists of 183 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-23 10:03:17,543 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:18,943 INFO L146 ILogger]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:18,943 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:18,943 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 10:03:18,944 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 10:03:18,944 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 10:03:18,944 INFO L146 ILogger]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 10:03:18,945 INFO L146 ILogger]: Start difference. First operand 109 states and 109 transitions. Second operand 54 states. [2019-05-23 10:03:19,106 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:19,106 INFO L146 ILogger]: Finished difference Result 112 states and 112 transitions. [2019-05-23 10:03:19,106 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 10:03:19,107 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 108 [2019-05-23 10:03:19,107 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:19,108 INFO L146 ILogger]: With dead ends: 112 [2019-05-23 10:03:19,108 INFO L146 ILogger]: Without dead ends: 112 [2019-05-23 10:03:19,109 INFO L146 ILogger]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 10:03:19,109 INFO L146 ILogger]: Start minimizeSevpa. Operand 112 states. [2019-05-23 10:03:19,111 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-05-23 10:03:19,111 INFO L146 ILogger]: Start removeUnreachable. Operand 111 states. [2019-05-23 10:03:19,112 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-05-23 10:03:19,112 INFO L146 ILogger]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-05-23 10:03:19,112 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:19,112 INFO L146 ILogger]: Abstraction has 111 states and 111 transitions. [2019-05-23 10:03:19,112 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 10:03:19,112 INFO L146 ILogger]: Start isEmpty. Operand 111 states and 111 transitions. [2019-05-23 10:03:19,113 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 111 [2019-05-23 10:03:19,113 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:19,113 INFO L146 ILogger]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:19,113 INFO L146 ILogger]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:19,114 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:19,114 INFO L146 ILogger]: Analyzing trace with hash 719201181, now seen corresponding path program 52 times [2019-05-23 10:03:19,114 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:19,124 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:19,126 INFO L146 ILogger]: Trace formula consists of 186 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 10:03:19,128 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:20,101 INFO L146 ILogger]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:20,102 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:20,102 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 10:03:20,102 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 10:03:20,103 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 10:03:20,103 INFO L146 ILogger]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 10:03:20,103 INFO L146 ILogger]: Start difference. First operand 111 states and 111 transitions. Second operand 55 states. [2019-05-23 10:03:20,428 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:20,428 INFO L146 ILogger]: Finished difference Result 114 states and 114 transitions. [2019-05-23 10:03:20,429 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 10:03:20,429 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 110 [2019-05-23 10:03:20,429 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:20,430 INFO L146 ILogger]: With dead ends: 114 [2019-05-23 10:03:20,430 INFO L146 ILogger]: Without dead ends: 114 [2019-05-23 10:03:20,431 INFO L146 ILogger]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 10:03:20,431 INFO L146 ILogger]: Start minimizeSevpa. Operand 114 states. [2019-05-23 10:03:20,433 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-05-23 10:03:20,433 INFO L146 ILogger]: Start removeUnreachable. Operand 113 states. [2019-05-23 10:03:20,433 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-05-23 10:03:20,434 INFO L146 ILogger]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-05-23 10:03:20,434 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:20,434 INFO L146 ILogger]: Abstraction has 113 states and 113 transitions. [2019-05-23 10:03:20,434 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 10:03:20,434 INFO L146 ILogger]: Start isEmpty. Operand 113 states and 113 transitions. [2019-05-23 10:03:20,435 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 113 [2019-05-23 10:03:20,435 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:20,435 INFO L146 ILogger]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:20,435 INFO L146 ILogger]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:20,435 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:20,436 INFO L146 ILogger]: Analyzing trace with hash -1256363973, now seen corresponding path program 53 times [2019-05-23 10:03:20,436 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:20,446 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:20,448 INFO L146 ILogger]: Trace formula consists of 189 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-23 10:03:20,449 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:21,527 INFO L146 ILogger]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:21,527 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:21,528 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 10:03:21,528 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 10:03:21,528 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 10:03:21,529 INFO L146 ILogger]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 10:03:21,529 INFO L146 ILogger]: Start difference. First operand 113 states and 113 transitions. Second operand 56 states. [2019-05-23 10:03:21,806 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:21,806 INFO L146 ILogger]: Finished difference Result 116 states and 116 transitions. [2019-05-23 10:03:21,807 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 10:03:21,807 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 112 [2019-05-23 10:03:21,807 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:21,808 INFO L146 ILogger]: With dead ends: 116 [2019-05-23 10:03:21,808 INFO L146 ILogger]: Without dead ends: 116 [2019-05-23 10:03:21,809 INFO L146 ILogger]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 10:03:21,810 INFO L146 ILogger]: Start minimizeSevpa. Operand 116 states. [2019-05-23 10:03:21,811 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-05-23 10:03:21,812 INFO L146 ILogger]: Start removeUnreachable. Operand 115 states. [2019-05-23 10:03:21,812 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-05-23 10:03:21,812 INFO L146 ILogger]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-05-23 10:03:21,812 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:21,812 INFO L146 ILogger]: Abstraction has 115 states and 115 transitions. [2019-05-23 10:03:21,813 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 10:03:21,813 INFO L146 ILogger]: Start isEmpty. Operand 115 states and 115 transitions. [2019-05-23 10:03:21,814 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 115 [2019-05-23 10:03:21,814 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:21,814 INFO L146 ILogger]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:21,814 INFO L146 ILogger]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:21,814 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:21,815 INFO L146 ILogger]: Analyzing trace with hash -1398932135, now seen corresponding path program 54 times [2019-05-23 10:03:21,815 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:21,836 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:21,838 INFO L146 ILogger]: Trace formula consists of 192 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 10:03:21,840 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:23,260 INFO L146 ILogger]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:23,260 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:23,260 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 10:03:23,261 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 10:03:23,261 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 10:03:23,261 INFO L146 ILogger]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 10:03:23,261 INFO L146 ILogger]: Start difference. First operand 115 states and 115 transitions. Second operand 57 states. [2019-05-23 10:03:23,852 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:23,852 INFO L146 ILogger]: Finished difference Result 118 states and 118 transitions. [2019-05-23 10:03:23,853 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 10:03:23,853 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 114 [2019-05-23 10:03:23,853 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:23,854 INFO L146 ILogger]: With dead ends: 118 [2019-05-23 10:03:23,854 INFO L146 ILogger]: Without dead ends: 118 [2019-05-23 10:03:23,855 INFO L146 ILogger]: 0 DeclaredPredicates, 113 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 10:03:23,855 INFO L146 ILogger]: Start minimizeSevpa. Operand 118 states. [2019-05-23 10:03:23,857 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-05-23 10:03:23,857 INFO L146 ILogger]: Start removeUnreachable. Operand 117 states. [2019-05-23 10:03:23,858 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-05-23 10:03:23,858 INFO L146 ILogger]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-05-23 10:03:23,858 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:23,858 INFO L146 ILogger]: Abstraction has 117 states and 117 transitions. [2019-05-23 10:03:23,858 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 10:03:23,858 INFO L146 ILogger]: Start isEmpty. Operand 117 states and 117 transitions. [2019-05-23 10:03:23,859 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 117 [2019-05-23 10:03:23,859 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:23,859 INFO L146 ILogger]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:23,859 INFO L146 ILogger]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:23,859 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:23,859 INFO L146 ILogger]: Analyzing trace with hash -967982345, now seen corresponding path program 55 times [2019-05-23 10:03:23,860 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:23,869 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:23,871 INFO L146 ILogger]: Trace formula consists of 195 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 10:03:23,873 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:25,087 INFO L146 ILogger]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:25,088 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:25,088 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 10:03:25,088 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 10:03:25,088 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 10:03:25,089 INFO L146 ILogger]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 10:03:25,089 INFO L146 ILogger]: Start difference. First operand 117 states and 117 transitions. Second operand 58 states. [2019-05-23 10:03:25,256 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:25,256 INFO L146 ILogger]: Finished difference Result 120 states and 120 transitions. [2019-05-23 10:03:25,256 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 10:03:25,257 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 116 [2019-05-23 10:03:25,257 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:25,258 INFO L146 ILogger]: With dead ends: 120 [2019-05-23 10:03:25,258 INFO L146 ILogger]: Without dead ends: 120 [2019-05-23 10:03:25,258 INFO L146 ILogger]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 10:03:25,259 INFO L146 ILogger]: Start minimizeSevpa. Operand 120 states. [2019-05-23 10:03:25,261 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-05-23 10:03:25,261 INFO L146 ILogger]: Start removeUnreachable. Operand 119 states. [2019-05-23 10:03:25,261 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-05-23 10:03:25,262 INFO L146 ILogger]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-05-23 10:03:25,262 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:25,262 INFO L146 ILogger]: Abstraction has 119 states and 119 transitions. [2019-05-23 10:03:25,262 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 10:03:25,262 INFO L146 ILogger]: Start isEmpty. Operand 119 states and 119 transitions. [2019-05-23 10:03:25,263 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 119 [2019-05-23 10:03:25,263 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:25,263 INFO L146 ILogger]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:25,263 INFO L146 ILogger]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:25,263 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:25,263 INFO L146 ILogger]: Analyzing trace with hash 857905429, now seen corresponding path program 56 times [2019-05-23 10:03:25,264 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:25,274 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:25,276 INFO L146 ILogger]: Trace formula consists of 198 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 10:03:25,278 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:26,944 INFO L146 ILogger]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:26,944 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:26,945 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 10:03:26,945 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 10:03:26,945 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 10:03:26,946 INFO L146 ILogger]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 10:03:26,946 INFO L146 ILogger]: Start difference. First operand 119 states and 119 transitions. Second operand 59 states. [2019-05-23 10:03:27,118 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:27,119 INFO L146 ILogger]: Finished difference Result 122 states and 122 transitions. [2019-05-23 10:03:27,119 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 10:03:27,119 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 118 [2019-05-23 10:03:27,120 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:27,120 INFO L146 ILogger]: With dead ends: 122 [2019-05-23 10:03:27,120 INFO L146 ILogger]: Without dead ends: 122 [2019-05-23 10:03:27,121 INFO L146 ILogger]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 10:03:27,121 INFO L146 ILogger]: Start minimizeSevpa. Operand 122 states. [2019-05-23 10:03:27,123 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-05-23 10:03:27,123 INFO L146 ILogger]: Start removeUnreachable. Operand 121 states. [2019-05-23 10:03:27,123 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-05-23 10:03:27,123 INFO L146 ILogger]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-05-23 10:03:27,123 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:27,123 INFO L146 ILogger]: Abstraction has 121 states and 121 transitions. [2019-05-23 10:03:27,124 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 10:03:27,124 INFO L146 ILogger]: Start isEmpty. Operand 121 states and 121 transitions. [2019-05-23 10:03:27,124 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 121 [2019-05-23 10:03:27,124 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:27,124 INFO L146 ILogger]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:27,124 INFO L146 ILogger]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:27,124 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:27,125 INFO L146 ILogger]: Analyzing trace with hash -1105567821, now seen corresponding path program 57 times [2019-05-23 10:03:27,125 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:27,136 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:27,137 INFO L146 ILogger]: Trace formula consists of 201 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-23 10:03:27,139 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:28,281 INFO L146 ILogger]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:28,282 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:28,282 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 10:03:28,282 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 10:03:28,283 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 10:03:28,283 INFO L146 ILogger]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 10:03:28,283 INFO L146 ILogger]: Start difference. First operand 121 states and 121 transitions. Second operand 60 states. [2019-05-23 10:03:28,489 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:28,490 INFO L146 ILogger]: Finished difference Result 124 states and 124 transitions. [2019-05-23 10:03:28,490 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 10:03:28,490 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 120 [2019-05-23 10:03:28,490 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:28,491 INFO L146 ILogger]: With dead ends: 124 [2019-05-23 10:03:28,492 INFO L146 ILogger]: Without dead ends: 124 [2019-05-23 10:03:28,492 INFO L146 ILogger]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 10:03:28,493 INFO L146 ILogger]: Start minimizeSevpa. Operand 124 states. [2019-05-23 10:03:28,494 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-05-23 10:03:28,494 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 10:03:28,495 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-05-23 10:03:28,495 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-05-23 10:03:28,495 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:28,495 INFO L146 ILogger]: Abstraction has 123 states and 123 transitions. [2019-05-23 10:03:28,495 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 10:03:28,495 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 123 transitions. [2019-05-23 10:03:28,496 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 123 [2019-05-23 10:03:28,496 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:28,496 INFO L146 ILogger]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:28,496 INFO L146 ILogger]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:28,497 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:28,497 INFO L146 ILogger]: Analyzing trace with hash 1782249169, now seen corresponding path program 58 times [2019-05-23 10:03:28,497 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:28,507 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:28,509 INFO L146 ILogger]: Trace formula consists of 204 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 10:03:28,511 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:29,771 INFO L146 ILogger]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:29,772 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:29,772 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 10:03:29,772 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 10:03:29,772 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 10:03:29,773 INFO L146 ILogger]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 10:03:29,773 INFO L146 ILogger]: Start difference. First operand 123 states and 123 transitions. Second operand 61 states. [2019-05-23 10:03:29,931 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:29,931 INFO L146 ILogger]: Finished difference Result 126 states and 126 transitions. [2019-05-23 10:03:29,931 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 10:03:29,932 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 122 [2019-05-23 10:03:29,932 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:29,932 INFO L146 ILogger]: With dead ends: 126 [2019-05-23 10:03:29,933 INFO L146 ILogger]: Without dead ends: 126 [2019-05-23 10:03:29,933 INFO L146 ILogger]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 10:03:29,933 INFO L146 ILogger]: Start minimizeSevpa. Operand 126 states. [2019-05-23 10:03:29,935 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-05-23 10:03:29,935 INFO L146 ILogger]: Start removeUnreachable. Operand 125 states. [2019-05-23 10:03:29,935 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-05-23 10:03:29,936 INFO L146 ILogger]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-05-23 10:03:29,936 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:29,936 INFO L146 ILogger]: Abstraction has 125 states and 125 transitions. [2019-05-23 10:03:29,936 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 10:03:29,936 INFO L146 ILogger]: Start isEmpty. Operand 125 states and 125 transitions. [2019-05-23 10:03:29,936 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 125 [2019-05-23 10:03:29,936 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:29,936 INFO L146 ILogger]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:29,937 INFO L146 ILogger]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:29,937 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:29,937 INFO L146 ILogger]: Analyzing trace with hash -1869463953, now seen corresponding path program 59 times [2019-05-23 10:03:29,937 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:29,947 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:29,949 INFO L146 ILogger]: Trace formula consists of 207 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-23 10:03:29,951 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:31,266 INFO L146 ILogger]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:31,266 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:31,266 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 10:03:31,267 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 10:03:31,267 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 10:03:31,267 INFO L146 ILogger]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 10:03:31,267 INFO L146 ILogger]: Start difference. First operand 125 states and 125 transitions. Second operand 62 states. [2019-05-23 10:03:31,443 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:31,443 INFO L146 ILogger]: Finished difference Result 128 states and 128 transitions. [2019-05-23 10:03:31,444 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 10:03:31,444 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 124 [2019-05-23 10:03:31,444 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:31,445 INFO L146 ILogger]: With dead ends: 128 [2019-05-23 10:03:31,445 INFO L146 ILogger]: Without dead ends: 128 [2019-05-23 10:03:31,446 INFO L146 ILogger]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 10:03:31,446 INFO L146 ILogger]: Start minimizeSevpa. Operand 128 states. [2019-05-23 10:03:31,448 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-05-23 10:03:31,449 INFO L146 ILogger]: Start removeUnreachable. Operand 127 states. [2019-05-23 10:03:31,449 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-05-23 10:03:31,449 INFO L146 ILogger]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-05-23 10:03:31,449 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:31,449 INFO L146 ILogger]: Abstraction has 127 states and 127 transitions. [2019-05-23 10:03:31,450 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 10:03:31,450 INFO L146 ILogger]: Start isEmpty. Operand 127 states and 127 transitions. [2019-05-23 10:03:31,450 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 127 [2019-05-23 10:03:31,450 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:31,450 INFO L146 ILogger]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:31,451 INFO L146 ILogger]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:31,451 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:31,451 INFO L146 ILogger]: Analyzing trace with hash 2117473933, now seen corresponding path program 60 times [2019-05-23 10:03:31,452 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:31,462 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:31,464 INFO L146 ILogger]: Trace formula consists of 210 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 10:03:31,466 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:32,785 INFO L146 ILogger]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:32,785 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:32,785 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 10:03:32,786 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 10:03:32,786 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 10:03:32,786 INFO L146 ILogger]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 10:03:32,786 INFO L146 ILogger]: Start difference. First operand 127 states and 127 transitions. Second operand 63 states. [2019-05-23 10:03:32,974 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:32,975 INFO L146 ILogger]: Finished difference Result 130 states and 130 transitions. [2019-05-23 10:03:32,975 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 10:03:32,975 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 126 [2019-05-23 10:03:32,975 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:32,976 INFO L146 ILogger]: With dead ends: 130 [2019-05-23 10:03:32,976 INFO L146 ILogger]: Without dead ends: 130 [2019-05-23 10:03:32,977 INFO L146 ILogger]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 10:03:32,977 INFO L146 ILogger]: Start minimizeSevpa. Operand 130 states. [2019-05-23 10:03:32,978 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-05-23 10:03:32,979 INFO L146 ILogger]: Start removeUnreachable. Operand 129 states. [2019-05-23 10:03:32,979 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-05-23 10:03:32,979 INFO L146 ILogger]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-05-23 10:03:32,979 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:32,979 INFO L146 ILogger]: Abstraction has 129 states and 129 transitions. [2019-05-23 10:03:32,979 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 10:03:32,979 INFO L146 ILogger]: Start isEmpty. Operand 129 states and 129 transitions. [2019-05-23 10:03:32,980 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 129 [2019-05-23 10:03:32,980 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:32,980 INFO L146 ILogger]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:32,980 INFO L146 ILogger]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:32,980 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:32,980 INFO L146 ILogger]: Analyzing trace with hash -1841012949, now seen corresponding path program 61 times [2019-05-23 10:03:32,981 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:32,991 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:32,993 INFO L146 ILogger]: Trace formula consists of 213 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 10:03:32,995 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:34,403 INFO L146 ILogger]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:34,403 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:34,403 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 10:03:34,403 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 10:03:34,404 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 10:03:34,404 INFO L146 ILogger]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 10:03:34,404 INFO L146 ILogger]: Start difference. First operand 129 states and 129 transitions. Second operand 64 states. [2019-05-23 10:03:34,847 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:34,848 INFO L146 ILogger]: Finished difference Result 132 states and 132 transitions. [2019-05-23 10:03:34,848 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 10:03:34,848 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 128 [2019-05-23 10:03:34,848 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:34,849 INFO L146 ILogger]: With dead ends: 132 [2019-05-23 10:03:34,849 INFO L146 ILogger]: Without dead ends: 132 [2019-05-23 10:03:34,850 INFO L146 ILogger]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 10:03:34,850 INFO L146 ILogger]: Start minimizeSevpa. Operand 132 states. [2019-05-23 10:03:34,853 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-05-23 10:03:34,853 INFO L146 ILogger]: Start removeUnreachable. Operand 131 states. [2019-05-23 10:03:34,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-05-23 10:03:34,853 INFO L146 ILogger]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-05-23 10:03:34,854 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:34,854 INFO L146 ILogger]: Abstraction has 131 states and 131 transitions. [2019-05-23 10:03:34,854 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 10:03:34,854 INFO L146 ILogger]: Start isEmpty. Operand 131 states and 131 transitions. [2019-05-23 10:03:34,855 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 131 [2019-05-23 10:03:34,855 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:34,856 INFO L146 ILogger]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:34,856 INFO L146 ILogger]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:34,856 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:34,856 INFO L146 ILogger]: Analyzing trace with hash -605882295, now seen corresponding path program 62 times [2019-05-23 10:03:34,857 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:34,878 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:34,881 INFO L146 ILogger]: Trace formula consists of 216 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 10:03:34,884 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:36,674 INFO L146 ILogger]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:36,674 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:36,674 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 10:03:36,674 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 10:03:36,675 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 10:03:36,675 INFO L146 ILogger]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 10:03:36,675 INFO L146 ILogger]: Start difference. First operand 131 states and 131 transitions. Second operand 65 states. [2019-05-23 10:03:36,873 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:36,874 INFO L146 ILogger]: Finished difference Result 134 states and 134 transitions. [2019-05-23 10:03:36,874 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 10:03:36,874 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 130 [2019-05-23 10:03:36,874 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:36,875 INFO L146 ILogger]: With dead ends: 134 [2019-05-23 10:03:36,875 INFO L146 ILogger]: Without dead ends: 134 [2019-05-23 10:03:36,876 INFO L146 ILogger]: 0 DeclaredPredicates, 129 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 10:03:36,876 INFO L146 ILogger]: Start minimizeSevpa. Operand 134 states. [2019-05-23 10:03:36,878 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-05-23 10:03:36,878 INFO L146 ILogger]: Start removeUnreachable. Operand 133 states. [2019-05-23 10:03:36,878 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-05-23 10:03:36,878 INFO L146 ILogger]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-05-23 10:03:36,878 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:36,878 INFO L146 ILogger]: Abstraction has 133 states and 133 transitions. [2019-05-23 10:03:36,879 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 10:03:36,879 INFO L146 ILogger]: Start isEmpty. Operand 133 states and 133 transitions. [2019-05-23 10:03:36,879 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 133 [2019-05-23 10:03:36,879 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:36,879 INFO L146 ILogger]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:36,879 INFO L146 ILogger]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:36,879 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:36,880 INFO L146 ILogger]: Analyzing trace with hash 943702503, now seen corresponding path program 63 times [2019-05-23 10:03:36,880 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:36,891 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:36,893 INFO L146 ILogger]: Trace formula consists of 219 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-23 10:03:36,895 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:38,352 INFO L146 ILogger]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:38,352 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:38,352 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 10:03:38,353 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 10:03:38,353 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 10:03:38,353 INFO L146 ILogger]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 10:03:38,354 INFO L146 ILogger]: Start difference. First operand 133 states and 133 transitions. Second operand 66 states. [2019-05-23 10:03:40,293 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:40,294 INFO L146 ILogger]: Finished difference Result 136 states and 136 transitions. [2019-05-23 10:03:40,294 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 10:03:40,294 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 132 [2019-05-23 10:03:40,294 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:40,295 INFO L146 ILogger]: With dead ends: 136 [2019-05-23 10:03:40,295 INFO L146 ILogger]: Without dead ends: 136 [2019-05-23 10:03:40,296 INFO L146 ILogger]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 10:03:40,296 INFO L146 ILogger]: Start minimizeSevpa. Operand 136 states. [2019-05-23 10:03:40,298 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-05-23 10:03:40,298 INFO L146 ILogger]: Start removeUnreachable. Operand 135 states. [2019-05-23 10:03:40,299 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-05-23 10:03:40,299 INFO L146 ILogger]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-05-23 10:03:40,299 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:40,299 INFO L146 ILogger]: Abstraction has 135 states and 135 transitions. [2019-05-23 10:03:40,299 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 10:03:40,299 INFO L146 ILogger]: Start isEmpty. Operand 135 states and 135 transitions. [2019-05-23 10:03:40,301 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 135 [2019-05-23 10:03:40,301 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:40,301 INFO L146 ILogger]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:40,301 INFO L146 ILogger]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:40,301 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:40,302 INFO L146 ILogger]: Analyzing trace with hash -258958331, now seen corresponding path program 64 times [2019-05-23 10:03:40,302 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:40,314 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:40,316 INFO L146 ILogger]: Trace formula consists of 222 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 10:03:40,318 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:42,642 INFO L146 ILogger]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:42,642 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:42,642 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 10:03:42,642 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 10:03:42,643 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 10:03:42,643 INFO L146 ILogger]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 10:03:42,643 INFO L146 ILogger]: Start difference. First operand 135 states and 135 transitions. Second operand 67 states. [2019-05-23 10:03:42,827 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:42,828 INFO L146 ILogger]: Finished difference Result 138 states and 138 transitions. [2019-05-23 10:03:42,828 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 10:03:42,828 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 134 [2019-05-23 10:03:42,828 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:42,829 INFO L146 ILogger]: With dead ends: 138 [2019-05-23 10:03:42,829 INFO L146 ILogger]: Without dead ends: 138 [2019-05-23 10:03:42,830 INFO L146 ILogger]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 10:03:42,830 INFO L146 ILogger]: Start minimizeSevpa. Operand 138 states. [2019-05-23 10:03:42,832 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-05-23 10:03:42,832 INFO L146 ILogger]: Start removeUnreachable. Operand 137 states. [2019-05-23 10:03:42,832 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-05-23 10:03:42,832 INFO L146 ILogger]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-05-23 10:03:42,833 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:42,833 INFO L146 ILogger]: Abstraction has 137 states and 137 transitions. [2019-05-23 10:03:42,833 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 10:03:42,833 INFO L146 ILogger]: Start isEmpty. Operand 137 states and 137 transitions. [2019-05-23 10:03:42,833 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 137 [2019-05-23 10:03:42,834 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:42,834 INFO L146 ILogger]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:42,834 INFO L146 ILogger]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:42,834 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:42,834 INFO L146 ILogger]: Analyzing trace with hash -669817181, now seen corresponding path program 65 times [2019-05-23 10:03:42,835 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:42,845 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:42,847 INFO L146 ILogger]: Trace formula consists of 225 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-23 10:03:42,850 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:44,467 INFO L146 ILogger]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:44,468 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:44,468 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 10:03:44,468 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 10:03:44,468 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 10:03:44,468 INFO L146 ILogger]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 10:03:44,469 INFO L146 ILogger]: Start difference. First operand 137 states and 137 transitions. Second operand 68 states. [2019-05-23 10:03:44,648 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:44,648 INFO L146 ILogger]: Finished difference Result 140 states and 140 transitions. [2019-05-23 10:03:44,649 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 10:03:44,649 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 136 [2019-05-23 10:03:44,649 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:44,650 INFO L146 ILogger]: With dead ends: 140 [2019-05-23 10:03:44,650 INFO L146 ILogger]: Without dead ends: 140 [2019-05-23 10:03:44,650 INFO L146 ILogger]: 0 DeclaredPredicates, 135 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 10:03:44,651 INFO L146 ILogger]: Start minimizeSevpa. Operand 140 states. [2019-05-23 10:03:44,652 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-05-23 10:03:44,652 INFO L146 ILogger]: Start removeUnreachable. Operand 139 states. [2019-05-23 10:03:44,653 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-05-23 10:03:44,653 INFO L146 ILogger]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-05-23 10:03:44,653 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:44,653 INFO L146 ILogger]: Abstraction has 139 states and 139 transitions. [2019-05-23 10:03:44,653 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 10:03:44,653 INFO L146 ILogger]: Start isEmpty. Operand 139 states and 139 transitions. [2019-05-23 10:03:44,654 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 139 [2019-05-23 10:03:44,654 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:44,654 INFO L146 ILogger]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:44,654 INFO L146 ILogger]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:44,654 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:44,654 INFO L146 ILogger]: Analyzing trace with hash -368180799, now seen corresponding path program 66 times [2019-05-23 10:03:44,655 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:44,666 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:44,668 INFO L146 ILogger]: Trace formula consists of 228 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 10:03:44,670 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:46,243 INFO L146 ILogger]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:46,244 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:46,244 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 10:03:46,244 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 10:03:46,245 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 10:03:46,245 INFO L146 ILogger]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 10:03:46,245 INFO L146 ILogger]: Start difference. First operand 139 states and 139 transitions. Second operand 69 states. [2019-05-23 10:03:46,494 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:46,494 INFO L146 ILogger]: Finished difference Result 142 states and 142 transitions. [2019-05-23 10:03:46,494 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 10:03:46,494 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 138 [2019-05-23 10:03:46,495 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:46,496 INFO L146 ILogger]: With dead ends: 142 [2019-05-23 10:03:46,496 INFO L146 ILogger]: Without dead ends: 142 [2019-05-23 10:03:46,496 INFO L146 ILogger]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 10:03:46,496 INFO L146 ILogger]: Start minimizeSevpa. Operand 142 states. [2019-05-23 10:03:46,498 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-05-23 10:03:46,498 INFO L146 ILogger]: Start removeUnreachable. Operand 141 states. [2019-05-23 10:03:46,499 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-05-23 10:03:46,499 INFO L146 ILogger]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-05-23 10:03:46,499 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:46,499 INFO L146 ILogger]: Abstraction has 141 states and 141 transitions. [2019-05-23 10:03:46,499 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 10:03:46,499 INFO L146 ILogger]: Start isEmpty. Operand 141 states and 141 transitions. [2019-05-23 10:03:46,500 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 141 [2019-05-23 10:03:46,500 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:46,500 INFO L146 ILogger]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:46,500 INFO L146 ILogger]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:46,500 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:46,500 INFO L146 ILogger]: Analyzing trace with hash 1741573471, now seen corresponding path program 67 times [2019-05-23 10:03:46,501 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:46,512 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:46,514 INFO L146 ILogger]: Trace formula consists of 231 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 10:03:46,516 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:48,147 INFO L146 ILogger]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:48,147 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:48,147 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 10:03:48,147 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 10:03:48,148 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 10:03:48,148 INFO L146 ILogger]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 10:03:48,148 INFO L146 ILogger]: Start difference. First operand 141 states and 141 transitions. Second operand 70 states. [2019-05-23 10:03:48,333 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:48,333 INFO L146 ILogger]: Finished difference Result 144 states and 144 transitions. [2019-05-23 10:03:48,333 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 10:03:48,334 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 140 [2019-05-23 10:03:48,334 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:48,335 INFO L146 ILogger]: With dead ends: 144 [2019-05-23 10:03:48,335 INFO L146 ILogger]: Without dead ends: 144 [2019-05-23 10:03:48,335 INFO L146 ILogger]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 10:03:48,336 INFO L146 ILogger]: Start minimizeSevpa. Operand 144 states. [2019-05-23 10:03:48,337 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-05-23 10:03:48,337 INFO L146 ILogger]: Start removeUnreachable. Operand 143 states. [2019-05-23 10:03:48,338 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-05-23 10:03:48,338 INFO L146 ILogger]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-05-23 10:03:48,338 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:48,338 INFO L146 ILogger]: Abstraction has 143 states and 143 transitions. [2019-05-23 10:03:48,338 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 10:03:48,338 INFO L146 ILogger]: Start isEmpty. Operand 143 states and 143 transitions. [2019-05-23 10:03:48,339 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 143 [2019-05-23 10:03:48,339 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:48,339 INFO L146 ILogger]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:48,339 INFO L146 ILogger]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:48,339 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:48,339 INFO L146 ILogger]: Analyzing trace with hash 1990863229, now seen corresponding path program 68 times [2019-05-23 10:03:48,340 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:48,349 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:48,352 INFO L146 ILogger]: Trace formula consists of 234 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 10:03:48,353 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:50,030 INFO L146 ILogger]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:50,030 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:50,030 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 10:03:50,031 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 10:03:50,031 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 10:03:50,031 INFO L146 ILogger]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 10:03:50,032 INFO L146 ILogger]: Start difference. First operand 143 states and 143 transitions. Second operand 71 states. [2019-05-23 10:03:50,305 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:50,306 INFO L146 ILogger]: Finished difference Result 146 states and 146 transitions. [2019-05-23 10:03:50,306 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 10:03:50,306 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 142 [2019-05-23 10:03:50,306 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:50,307 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 10:03:50,307 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 10:03:50,308 INFO L146 ILogger]: 0 DeclaredPredicates, 141 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 10:03:50,308 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 10:03:50,310 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-05-23 10:03:50,310 INFO L146 ILogger]: Start removeUnreachable. Operand 145 states. [2019-05-23 10:03:50,310 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-05-23 10:03:50,311 INFO L146 ILogger]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-05-23 10:03:50,311 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:50,311 INFO L146 ILogger]: Abstraction has 145 states and 145 transitions. [2019-05-23 10:03:50,311 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 10:03:50,311 INFO L146 ILogger]: Start isEmpty. Operand 145 states and 145 transitions. [2019-05-23 10:03:50,312 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 145 [2019-05-23 10:03:50,312 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:50,312 INFO L146 ILogger]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:50,312 INFO L146 ILogger]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:50,312 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:50,312 INFO L146 ILogger]: Analyzing trace with hash 1040152091, now seen corresponding path program 69 times [2019-05-23 10:03:50,313 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:50,323 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:50,325 INFO L146 ILogger]: Trace formula consists of 237 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-23 10:03:50,327 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:52,199 INFO L146 ILogger]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:52,199 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:52,199 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 10:03:52,200 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 10:03:52,200 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 10:03:52,200 INFO L146 ILogger]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 10:03:52,200 INFO L146 ILogger]: Start difference. First operand 145 states and 145 transitions. Second operand 72 states. [2019-05-23 10:03:52,399 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:52,400 INFO L146 ILogger]: Finished difference Result 148 states and 148 transitions. [2019-05-23 10:03:52,400 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 10:03:52,400 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 144 [2019-05-23 10:03:52,401 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:52,402 INFO L146 ILogger]: With dead ends: 148 [2019-05-23 10:03:52,402 INFO L146 ILogger]: Without dead ends: 148 [2019-05-23 10:03:52,402 INFO L146 ILogger]: 0 DeclaredPredicates, 143 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 10:03:52,403 INFO L146 ILogger]: Start minimizeSevpa. Operand 148 states. [2019-05-23 10:03:52,405 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-05-23 10:03:52,405 INFO L146 ILogger]: Start removeUnreachable. Operand 147 states. [2019-05-23 10:03:52,405 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-05-23 10:03:52,405 INFO L146 ILogger]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-05-23 10:03:52,406 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:52,406 INFO L146 ILogger]: Abstraction has 147 states and 147 transitions. [2019-05-23 10:03:52,406 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 10:03:52,406 INFO L146 ILogger]: Start isEmpty. Operand 147 states and 147 transitions. [2019-05-23 10:03:52,406 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 147 [2019-05-23 10:03:52,407 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:52,407 INFO L146 ILogger]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:52,407 INFO L146 ILogger]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:52,407 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:52,407 INFO L146 ILogger]: Analyzing trace with hash -2060184775, now seen corresponding path program 70 times [2019-05-23 10:03:52,408 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:52,417 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:52,419 INFO L146 ILogger]: Trace formula consists of 240 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 10:03:52,420 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:54,252 INFO L146 ILogger]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:54,252 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:54,252 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 10:03:54,253 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 10:03:54,253 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 10:03:54,253 INFO L146 ILogger]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 10:03:54,254 INFO L146 ILogger]: Start difference. First operand 147 states and 147 transitions. Second operand 73 states. [2019-05-23 10:03:54,529 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:54,530 INFO L146 ILogger]: Finished difference Result 150 states and 150 transitions. [2019-05-23 10:03:54,530 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 10:03:54,530 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 146 [2019-05-23 10:03:54,530 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:54,531 INFO L146 ILogger]: With dead ends: 150 [2019-05-23 10:03:54,531 INFO L146 ILogger]: Without dead ends: 150 [2019-05-23 10:03:54,532 INFO L146 ILogger]: 0 DeclaredPredicates, 145 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 10:03:54,532 INFO L146 ILogger]: Start minimizeSevpa. Operand 150 states. [2019-05-23 10:03:54,534 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-05-23 10:03:54,534 INFO L146 ILogger]: Start removeUnreachable. Operand 149 states. [2019-05-23 10:03:54,534 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-05-23 10:03:54,535 INFO L146 ILogger]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-05-23 10:03:54,535 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:54,535 INFO L146 ILogger]: Abstraction has 149 states and 149 transitions. [2019-05-23 10:03:54,535 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 10:03:54,535 INFO L146 ILogger]: Start isEmpty. Operand 149 states and 149 transitions. [2019-05-23 10:03:54,536 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 149 [2019-05-23 10:03:54,536 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:54,536 INFO L146 ILogger]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:54,536 INFO L146 ILogger]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:54,536 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:54,536 INFO L146 ILogger]: Analyzing trace with hash -776609577, now seen corresponding path program 71 times [2019-05-23 10:03:54,537 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:54,547 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:54,549 INFO L146 ILogger]: Trace formula consists of 243 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-23 10:03:54,551 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:56,485 INFO L146 ILogger]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:56,486 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:56,486 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 10:03:56,486 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 10:03:56,486 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 10:03:56,487 INFO L146 ILogger]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 10:03:56,487 INFO L146 ILogger]: Start difference. First operand 149 states and 149 transitions. Second operand 74 states. [2019-05-23 10:03:56,682 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:56,682 INFO L146 ILogger]: Finished difference Result 152 states and 152 transitions. [2019-05-23 10:03:56,682 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 10:03:56,682 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 148 [2019-05-23 10:03:56,683 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:56,684 INFO L146 ILogger]: With dead ends: 152 [2019-05-23 10:03:56,684 INFO L146 ILogger]: Without dead ends: 152 [2019-05-23 10:03:56,684 INFO L146 ILogger]: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 10:03:56,684 INFO L146 ILogger]: Start minimizeSevpa. Operand 152 states. [2019-05-23 10:03:56,687 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-05-23 10:03:56,687 INFO L146 ILogger]: Start removeUnreachable. Operand 151 states. [2019-05-23 10:03:56,687 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-05-23 10:03:56,687 INFO L146 ILogger]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-05-23 10:03:56,688 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:56,688 INFO L146 ILogger]: Abstraction has 151 states and 151 transitions. [2019-05-23 10:03:56,688 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 10:03:56,688 INFO L146 ILogger]: Start isEmpty. Operand 151 states and 151 transitions. [2019-05-23 10:03:56,688 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 151 [2019-05-23 10:03:56,689 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:56,689 INFO L146 ILogger]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:56,689 INFO L146 ILogger]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:56,689 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:56,689 INFO L146 ILogger]: Analyzing trace with hash 83541749, now seen corresponding path program 72 times [2019-05-23 10:03:56,690 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:56,702 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:56,704 INFO L146 ILogger]: Trace formula consists of 246 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 10:03:56,706 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:03:58,689 INFO L146 ILogger]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:03:58,690 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:03:58,690 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 10:03:58,690 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 10:03:58,690 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 10:03:58,691 INFO L146 ILogger]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 10:03:58,691 INFO L146 ILogger]: Start difference. First operand 151 states and 151 transitions. Second operand 75 states. [2019-05-23 10:03:58,901 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:03:58,901 INFO L146 ILogger]: Finished difference Result 154 states and 154 transitions. [2019-05-23 10:03:58,902 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 10:03:58,902 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 150 [2019-05-23 10:03:58,902 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:03:58,903 INFO L146 ILogger]: With dead ends: 154 [2019-05-23 10:03:58,904 INFO L146 ILogger]: Without dead ends: 154 [2019-05-23 10:03:58,904 INFO L146 ILogger]: 0 DeclaredPredicates, 149 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 10:03:58,905 INFO L146 ILogger]: Start minimizeSevpa. Operand 154 states. [2019-05-23 10:03:58,906 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-05-23 10:03:58,906 INFO L146 ILogger]: Start removeUnreachable. Operand 153 states. [2019-05-23 10:03:58,907 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-05-23 10:03:58,907 INFO L146 ILogger]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-05-23 10:03:58,907 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:03:58,907 INFO L146 ILogger]: Abstraction has 153 states and 153 transitions. [2019-05-23 10:03:58,907 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 10:03:58,907 INFO L146 ILogger]: Start isEmpty. Operand 153 states and 153 transitions. [2019-05-23 10:03:58,908 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 153 [2019-05-23 10:03:58,908 INFO L146 ILogger]: Found error trace [2019-05-23 10:03:58,908 INFO L146 ILogger]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1] [2019-05-23 10:03:58,908 INFO L146 ILogger]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:03:58,909 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:03:58,909 INFO L146 ILogger]: Analyzing trace with hash 2055245203, now seen corresponding path program 73 times [2019-05-23 10:03:58,909 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:03:58,921 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:03:58,923 INFO L146 ILogger]: Trace formula consists of 249 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 10:03:58,925 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:00,801 INFO L146 ILogger]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:00,801 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:00,802 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 10:04:00,802 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 10:04:00,802 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 10:04:00,803 INFO L146 ILogger]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 10:04:00,803 INFO L146 ILogger]: Start difference. First operand 153 states and 153 transitions. Second operand 76 states. [2019-05-23 10:04:01,062 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:01,063 INFO L146 ILogger]: Finished difference Result 156 states and 156 transitions. [2019-05-23 10:04:01,063 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 10:04:01,063 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 152 [2019-05-23 10:04:01,064 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:01,064 INFO L146 ILogger]: With dead ends: 156 [2019-05-23 10:04:01,065 INFO L146 ILogger]: Without dead ends: 156 [2019-05-23 10:04:01,065 INFO L146 ILogger]: 0 DeclaredPredicates, 151 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 10:04:01,065 INFO L146 ILogger]: Start minimizeSevpa. Operand 156 states. [2019-05-23 10:04:01,067 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-05-23 10:04:01,067 INFO L146 ILogger]: Start removeUnreachable. Operand 155 states. [2019-05-23 10:04:01,068 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-05-23 10:04:01,068 INFO L146 ILogger]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-05-23 10:04:01,068 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:01,068 INFO L146 ILogger]: Abstraction has 155 states and 155 transitions. [2019-05-23 10:04:01,068 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 10:04:01,068 INFO L146 ILogger]: Start isEmpty. Operand 155 states and 155 transitions. [2019-05-23 10:04:01,069 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 155 [2019-05-23 10:04:01,069 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:01,069 INFO L146 ILogger]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:01,069 INFO L146 ILogger]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:01,070 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:01,070 INFO L146 ILogger]: Analyzing trace with hash -1513280335, now seen corresponding path program 74 times [2019-05-23 10:04:01,070 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:01,081 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:01,084 INFO L146 ILogger]: Trace formula consists of 252 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 10:04:01,086 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:03,341 INFO L146 ILogger]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:03,341 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:03,341 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 10:04:03,341 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 10:04:03,342 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 10:04:03,342 INFO L146 ILogger]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 10:04:03,342 INFO L146 ILogger]: Start difference. First operand 155 states and 155 transitions. Second operand 77 states. [2019-05-23 10:04:03,563 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:03,563 INFO L146 ILogger]: Finished difference Result 158 states and 158 transitions. [2019-05-23 10:04:03,563 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 10:04:03,564 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 154 [2019-05-23 10:04:03,564 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:03,565 INFO L146 ILogger]: With dead ends: 158 [2019-05-23 10:04:03,565 INFO L146 ILogger]: Without dead ends: 158 [2019-05-23 10:04:03,565 INFO L146 ILogger]: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 10:04:03,566 INFO L146 ILogger]: Start minimizeSevpa. Operand 158 states. [2019-05-23 10:04:03,567 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-05-23 10:04:03,568 INFO L146 ILogger]: Start removeUnreachable. Operand 157 states. [2019-05-23 10:04:03,568 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-05-23 10:04:03,568 INFO L146 ILogger]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-05-23 10:04:03,568 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:03,568 INFO L146 ILogger]: Abstraction has 157 states and 157 transitions. [2019-05-23 10:04:03,568 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 10:04:03,568 INFO L146 ILogger]: Start isEmpty. Operand 157 states and 157 transitions. [2019-05-23 10:04:03,569 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 157 [2019-05-23 10:04:03,569 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:03,569 INFO L146 ILogger]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:03,569 INFO L146 ILogger]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:03,569 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:03,569 INFO L146 ILogger]: Analyzing trace with hash 812547151, now seen corresponding path program 75 times [2019-05-23 10:04:03,570 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:03,579 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:03,581 INFO L146 ILogger]: Trace formula consists of 255 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-23 10:04:03,583 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:05,555 INFO L146 ILogger]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:05,556 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:05,556 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 10:04:05,556 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 10:04:05,557 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 10:04:05,557 INFO L146 ILogger]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 10:04:05,557 INFO L146 ILogger]: Start difference. First operand 157 states and 157 transitions. Second operand 78 states. [2019-05-23 10:04:05,774 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:05,774 INFO L146 ILogger]: Finished difference Result 160 states and 160 transitions. [2019-05-23 10:04:05,774 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 10:04:05,774 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 156 [2019-05-23 10:04:05,775 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:05,776 INFO L146 ILogger]: With dead ends: 160 [2019-05-23 10:04:05,776 INFO L146 ILogger]: Without dead ends: 160 [2019-05-23 10:04:05,776 INFO L146 ILogger]: 0 DeclaredPredicates, 155 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 10:04:05,777 INFO L146 ILogger]: Start minimizeSevpa. Operand 160 states. [2019-05-23 10:04:05,779 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-05-23 10:04:05,779 INFO L146 ILogger]: Start removeUnreachable. Operand 159 states. [2019-05-23 10:04:05,779 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-05-23 10:04:05,779 INFO L146 ILogger]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-05-23 10:04:05,780 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:05,780 INFO L146 ILogger]: Abstraction has 159 states and 159 transitions. [2019-05-23 10:04:05,780 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 10:04:05,780 INFO L146 ILogger]: Start isEmpty. Operand 159 states and 159 transitions. [2019-05-23 10:04:05,780 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 159 [2019-05-23 10:04:05,780 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:05,780 INFO L146 ILogger]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:05,781 INFO L146 ILogger]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:05,781 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:05,781 INFO L146 ILogger]: Analyzing trace with hash -1745200019, now seen corresponding path program 76 times [2019-05-23 10:04:05,781 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:05,794 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:05,796 INFO L146 ILogger]: Trace formula consists of 258 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 10:04:05,798 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:07,865 INFO L146 ILogger]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:07,866 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:07,866 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 10:04:07,866 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 10:04:07,867 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 10:04:07,867 INFO L146 ILogger]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 10:04:07,867 INFO L146 ILogger]: Start difference. First operand 159 states and 159 transitions. Second operand 79 states. [2019-05-23 10:04:08,085 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:08,085 INFO L146 ILogger]: Finished difference Result 162 states and 162 transitions. [2019-05-23 10:04:08,086 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 10:04:08,086 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 158 [2019-05-23 10:04:08,086 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:08,087 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 10:04:08,087 INFO L146 ILogger]: Without dead ends: 162 [2019-05-23 10:04:08,088 INFO L146 ILogger]: 0 DeclaredPredicates, 157 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 10:04:08,088 INFO L146 ILogger]: Start minimizeSevpa. Operand 162 states. [2019-05-23 10:04:08,090 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-05-23 10:04:08,090 INFO L146 ILogger]: Start removeUnreachable. Operand 161 states. [2019-05-23 10:04:08,090 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-05-23 10:04:08,091 INFO L146 ILogger]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-05-23 10:04:08,091 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:08,091 INFO L146 ILogger]: Abstraction has 161 states and 161 transitions. [2019-05-23 10:04:08,091 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 10:04:08,091 INFO L146 ILogger]: Start isEmpty. Operand 161 states and 161 transitions. [2019-05-23 10:04:08,092 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 161 [2019-05-23 10:04:08,092 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:08,092 INFO L146 ILogger]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:08,092 INFO L146 ILogger]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:08,092 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:08,093 INFO L146 ILogger]: Analyzing trace with hash 1276030219, now seen corresponding path program 77 times [2019-05-23 10:04:08,093 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:08,105 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:08,107 INFO L146 ILogger]: Trace formula consists of 261 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-23 10:04:08,109 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:10,146 INFO L146 ILogger]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:10,146 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:10,146 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 10:04:10,146 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 10:04:10,147 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 10:04:10,147 INFO L146 ILogger]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 10:04:10,147 INFO L146 ILogger]: Start difference. First operand 161 states and 161 transitions. Second operand 80 states. [2019-05-23 10:04:10,365 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:10,365 INFO L146 ILogger]: Finished difference Result 164 states and 164 transitions. [2019-05-23 10:04:10,365 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 10:04:10,365 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 160 [2019-05-23 10:04:10,366 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:10,367 INFO L146 ILogger]: With dead ends: 164 [2019-05-23 10:04:10,367 INFO L146 ILogger]: Without dead ends: 164 [2019-05-23 10:04:10,367 INFO L146 ILogger]: 0 DeclaredPredicates, 159 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 10:04:10,368 INFO L146 ILogger]: Start minimizeSevpa. Operand 164 states. [2019-05-23 10:04:10,370 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-05-23 10:04:10,370 INFO L146 ILogger]: Start removeUnreachable. Operand 163 states. [2019-05-23 10:04:10,370 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-05-23 10:04:10,371 INFO L146 ILogger]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-05-23 10:04:10,371 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:10,371 INFO L146 ILogger]: Abstraction has 163 states and 163 transitions. [2019-05-23 10:04:10,371 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 10:04:10,371 INFO L146 ILogger]: Start isEmpty. Operand 163 states and 163 transitions. [2019-05-23 10:04:10,372 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 163 [2019-05-23 10:04:10,372 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:10,372 INFO L146 ILogger]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:10,372 INFO L146 ILogger]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:10,372 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:10,373 INFO L146 ILogger]: Analyzing trace with hash 1280396841, now seen corresponding path program 78 times [2019-05-23 10:04:10,373 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:10,385 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:10,387 INFO L146 ILogger]: Trace formula consists of 264 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 10:04:10,389 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:12,947 INFO L146 ILogger]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:12,948 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:12,948 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 10:04:12,948 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 10:04:12,949 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 10:04:12,949 INFO L146 ILogger]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 10:04:12,949 INFO L146 ILogger]: Start difference. First operand 163 states and 163 transitions. Second operand 81 states. [2019-05-23 10:04:13,169 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:13,169 INFO L146 ILogger]: Finished difference Result 166 states and 166 transitions. [2019-05-23 10:04:13,169 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 10:04:13,170 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 162 [2019-05-23 10:04:13,170 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:13,171 INFO L146 ILogger]: With dead ends: 166 [2019-05-23 10:04:13,171 INFO L146 ILogger]: Without dead ends: 166 [2019-05-23 10:04:13,171 INFO L146 ILogger]: 0 DeclaredPredicates, 161 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 10:04:13,172 INFO L146 ILogger]: Start minimizeSevpa. Operand 166 states. [2019-05-23 10:04:13,173 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-05-23 10:04:13,174 INFO L146 ILogger]: Start removeUnreachable. Operand 165 states. [2019-05-23 10:04:13,174 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-05-23 10:04:13,174 INFO L146 ILogger]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-05-23 10:04:13,174 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:13,174 INFO L146 ILogger]: Abstraction has 165 states and 165 transitions. [2019-05-23 10:04:13,174 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 10:04:13,174 INFO L146 ILogger]: Start isEmpty. Operand 165 states and 165 transitions. [2019-05-23 10:04:13,175 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 165 [2019-05-23 10:04:13,175 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:13,175 INFO L146 ILogger]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:13,176 INFO L146 ILogger]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:13,176 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:13,176 INFO L146 ILogger]: Analyzing trace with hash 1181753287, now seen corresponding path program 79 times [2019-05-23 10:04:13,176 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:13,188 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:13,190 INFO L146 ILogger]: Trace formula consists of 267 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 10:04:13,192 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:15,541 INFO L146 ILogger]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:15,541 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:15,542 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 10:04:15,542 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 10:04:15,542 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 10:04:15,542 INFO L146 ILogger]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 10:04:15,543 INFO L146 ILogger]: Start difference. First operand 165 states and 165 transitions. Second operand 82 states. [2019-05-23 10:04:15,765 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:15,765 INFO L146 ILogger]: Finished difference Result 168 states and 168 transitions. [2019-05-23 10:04:15,766 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 10:04:15,766 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 164 [2019-05-23 10:04:15,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:15,767 INFO L146 ILogger]: With dead ends: 168 [2019-05-23 10:04:15,767 INFO L146 ILogger]: Without dead ends: 168 [2019-05-23 10:04:15,768 INFO L146 ILogger]: 0 DeclaredPredicates, 163 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 10:04:15,768 INFO L146 ILogger]: Start minimizeSevpa. Operand 168 states. [2019-05-23 10:04:15,769 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-05-23 10:04:15,770 INFO L146 ILogger]: Start removeUnreachable. Operand 167 states. [2019-05-23 10:04:15,770 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-05-23 10:04:15,770 INFO L146 ILogger]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-05-23 10:04:15,770 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:15,770 INFO L146 ILogger]: Abstraction has 167 states and 167 transitions. [2019-05-23 10:04:15,770 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 10:04:15,770 INFO L146 ILogger]: Start isEmpty. Operand 167 states and 167 transitions. [2019-05-23 10:04:15,771 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 167 [2019-05-23 10:04:15,771 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:15,771 INFO L146 ILogger]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:15,771 INFO L146 ILogger]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:15,771 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:15,772 INFO L146 ILogger]: Analyzing trace with hash 874578405, now seen corresponding path program 80 times [2019-05-23 10:04:15,772 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:15,780 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:15,782 INFO L146 ILogger]: Trace formula consists of 270 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 10:04:15,784 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:17,962 INFO L146 ILogger]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:17,963 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:17,963 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 10:04:17,963 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 10:04:17,964 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 10:04:17,964 INFO L146 ILogger]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 10:04:17,964 INFO L146 ILogger]: Start difference. First operand 167 states and 167 transitions. Second operand 83 states. [2019-05-23 10:04:18,191 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:18,191 INFO L146 ILogger]: Finished difference Result 170 states and 170 transitions. [2019-05-23 10:04:18,192 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 10:04:18,192 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 166 [2019-05-23 10:04:18,192 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:18,193 INFO L146 ILogger]: With dead ends: 170 [2019-05-23 10:04:18,193 INFO L146 ILogger]: Without dead ends: 170 [2019-05-23 10:04:18,194 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 10:04:18,194 INFO L146 ILogger]: Start minimizeSevpa. Operand 170 states. [2019-05-23 10:04:18,196 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-05-23 10:04:18,196 INFO L146 ILogger]: Start removeUnreachable. Operand 169 states. [2019-05-23 10:04:18,196 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-05-23 10:04:18,196 INFO L146 ILogger]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-05-23 10:04:18,196 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:18,197 INFO L146 ILogger]: Abstraction has 169 states and 169 transitions. [2019-05-23 10:04:18,197 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 10:04:18,197 INFO L146 ILogger]: Start isEmpty. Operand 169 states and 169 transitions. [2019-05-23 10:04:18,197 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 169 [2019-05-23 10:04:18,197 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:18,197 INFO L146 ILogger]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:18,198 INFO L146 ILogger]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:18,198 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:18,198 INFO L146 ILogger]: Analyzing trace with hash 2032260227, now seen corresponding path program 81 times [2019-05-23 10:04:18,198 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:18,208 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:18,209 INFO L146 ILogger]: Trace formula consists of 273 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-23 10:04:18,211 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:20,467 INFO L146 ILogger]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:20,467 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:20,468 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 10:04:20,468 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 10:04:20,468 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 10:04:20,469 INFO L146 ILogger]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 10:04:20,469 INFO L146 ILogger]: Start difference. First operand 169 states and 169 transitions. Second operand 84 states. [2019-05-23 10:04:20,703 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:20,704 INFO L146 ILogger]: Finished difference Result 172 states and 172 transitions. [2019-05-23 10:04:20,704 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 10:04:20,704 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 168 [2019-05-23 10:04:20,704 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:20,705 INFO L146 ILogger]: With dead ends: 172 [2019-05-23 10:04:20,705 INFO L146 ILogger]: Without dead ends: 172 [2019-05-23 10:04:20,706 INFO L146 ILogger]: 0 DeclaredPredicates, 167 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 10:04:20,706 INFO L146 ILogger]: Start minimizeSevpa. Operand 172 states. [2019-05-23 10:04:20,707 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-05-23 10:04:20,707 INFO L146 ILogger]: Start removeUnreachable. Operand 171 states. [2019-05-23 10:04:20,708 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-05-23 10:04:20,708 INFO L146 ILogger]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-05-23 10:04:20,708 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:20,708 INFO L146 ILogger]: Abstraction has 171 states and 171 transitions. [2019-05-23 10:04:20,708 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 10:04:20,708 INFO L146 ILogger]: Start isEmpty. Operand 171 states and 171 transitions. [2019-05-23 10:04:20,709 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 171 [2019-05-23 10:04:20,709 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:20,709 INFO L146 ILogger]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:20,709 INFO L146 ILogger]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:20,709 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:20,709 INFO L146 ILogger]: Analyzing trace with hash -2127005791, now seen corresponding path program 82 times [2019-05-23 10:04:20,710 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:20,718 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:20,720 INFO L146 ILogger]: Trace formula consists of 276 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 10:04:20,721 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:23,374 INFO L146 ILogger]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:23,374 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:23,375 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 10:04:23,375 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 10:04:23,376 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 10:04:23,376 INFO L146 ILogger]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 10:04:23,376 INFO L146 ILogger]: Start difference. First operand 171 states and 171 transitions. Second operand 85 states. [2019-05-23 10:04:23,628 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:23,628 INFO L146 ILogger]: Finished difference Result 174 states and 174 transitions. [2019-05-23 10:04:23,628 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 10:04:23,629 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 170 [2019-05-23 10:04:23,629 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:23,630 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 10:04:23,630 INFO L146 ILogger]: Without dead ends: 174 [2019-05-23 10:04:23,630 INFO L146 ILogger]: 0 DeclaredPredicates, 169 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 10:04:23,631 INFO L146 ILogger]: Start minimizeSevpa. Operand 174 states. [2019-05-23 10:04:23,633 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-05-23 10:04:23,633 INFO L146 ILogger]: Start removeUnreachable. Operand 173 states. [2019-05-23 10:04:23,634 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-05-23 10:04:23,634 INFO L146 ILogger]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-05-23 10:04:23,634 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:23,634 INFO L146 ILogger]: Abstraction has 173 states and 173 transitions. [2019-05-23 10:04:23,634 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 10:04:23,634 INFO L146 ILogger]: Start isEmpty. Operand 173 states and 173 transitions. [2019-05-23 10:04:23,635 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 173 [2019-05-23 10:04:23,635 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:23,635 INFO L146 ILogger]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:23,636 INFO L146 ILogger]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:23,636 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:23,636 INFO L146 ILogger]: Analyzing trace with hash -567096513, now seen corresponding path program 83 times [2019-05-23 10:04:23,636 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:23,649 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:23,651 INFO L146 ILogger]: Trace formula consists of 279 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-23 10:04:23,653 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:25,973 INFO L146 ILogger]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:25,973 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:25,973 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 10:04:25,974 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 10:04:25,974 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 10:04:25,974 INFO L146 ILogger]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 10:04:25,975 INFO L146 ILogger]: Start difference. First operand 173 states and 173 transitions. Second operand 86 states. [2019-05-23 10:04:26,210 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:26,211 INFO L146 ILogger]: Finished difference Result 176 states and 176 transitions. [2019-05-23 10:04:26,211 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 10:04:26,211 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 172 [2019-05-23 10:04:26,212 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:26,212 INFO L146 ILogger]: With dead ends: 176 [2019-05-23 10:04:26,213 INFO L146 ILogger]: Without dead ends: 176 [2019-05-23 10:04:26,213 INFO L146 ILogger]: 0 DeclaredPredicates, 171 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 10:04:26,213 INFO L146 ILogger]: Start minimizeSevpa. Operand 176 states. [2019-05-23 10:04:26,215 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-05-23 10:04:26,215 INFO L146 ILogger]: Start removeUnreachable. Operand 175 states. [2019-05-23 10:04:26,215 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-05-23 10:04:26,216 INFO L146 ILogger]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-05-23 10:04:26,216 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:26,216 INFO L146 ILogger]: Abstraction has 175 states and 175 transitions. [2019-05-23 10:04:26,216 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 10:04:26,216 INFO L146 ILogger]: Start isEmpty. Operand 175 states and 175 transitions. [2019-05-23 10:04:26,217 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 175 [2019-05-23 10:04:26,217 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:26,217 INFO L146 ILogger]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:26,217 INFO L146 ILogger]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:26,218 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:26,218 INFO L146 ILogger]: Analyzing trace with hash -437866659, now seen corresponding path program 84 times [2019-05-23 10:04:26,218 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:26,231 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:26,234 INFO L146 ILogger]: Trace formula consists of 282 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 10:04:26,236 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:28,654 INFO L146 ILogger]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:28,655 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:28,655 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 10:04:28,655 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 10:04:28,655 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 10:04:28,656 INFO L146 ILogger]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 10:04:28,656 INFO L146 ILogger]: Start difference. First operand 175 states and 175 transitions. Second operand 87 states. [2019-05-23 10:04:28,907 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:28,908 INFO L146 ILogger]: Finished difference Result 178 states and 178 transitions. [2019-05-23 10:04:28,908 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 10:04:28,908 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 174 [2019-05-23 10:04:28,909 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:28,909 INFO L146 ILogger]: With dead ends: 178 [2019-05-23 10:04:28,910 INFO L146 ILogger]: Without dead ends: 178 [2019-05-23 10:04:28,910 INFO L146 ILogger]: 0 DeclaredPredicates, 173 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 10:04:28,910 INFO L146 ILogger]: Start minimizeSevpa. Operand 178 states. [2019-05-23 10:04:28,912 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-05-23 10:04:28,913 INFO L146 ILogger]: Start removeUnreachable. Operand 177 states. [2019-05-23 10:04:28,913 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-05-23 10:04:28,913 INFO L146 ILogger]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-05-23 10:04:28,914 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:28,914 INFO L146 ILogger]: Abstraction has 177 states and 177 transitions. [2019-05-23 10:04:28,914 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 10:04:28,914 INFO L146 ILogger]: Start isEmpty. Operand 177 states and 177 transitions. [2019-05-23 10:04:28,915 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 177 [2019-05-23 10:04:28,915 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:28,915 INFO L146 ILogger]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:28,915 INFO L146 ILogger]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:28,915 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:28,917 INFO L146 ILogger]: Analyzing trace with hash -802028549, now seen corresponding path program 85 times [2019-05-23 10:04:28,917 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:28,934 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:28,936 INFO L146 ILogger]: Trace formula consists of 285 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 10:04:28,938 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:31,494 INFO L146 ILogger]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:31,495 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:31,495 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 10:04:31,495 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 10:04:31,496 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 10:04:31,496 INFO L146 ILogger]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 10:04:31,496 INFO L146 ILogger]: Start difference. First operand 177 states and 177 transitions. Second operand 88 states. [2019-05-23 10:04:31,740 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:31,741 INFO L146 ILogger]: Finished difference Result 180 states and 180 transitions. [2019-05-23 10:04:31,741 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 10:04:31,741 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 176 [2019-05-23 10:04:31,742 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:31,743 INFO L146 ILogger]: With dead ends: 180 [2019-05-23 10:04:31,743 INFO L146 ILogger]: Without dead ends: 180 [2019-05-23 10:04:31,743 INFO L146 ILogger]: 0 DeclaredPredicates, 175 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 10:04:31,744 INFO L146 ILogger]: Start minimizeSevpa. Operand 180 states. [2019-05-23 10:04:31,746 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-05-23 10:04:31,746 INFO L146 ILogger]: Start removeUnreachable. Operand 179 states. [2019-05-23 10:04:31,746 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-05-23 10:04:31,746 INFO L146 ILogger]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-05-23 10:04:31,746 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:31,747 INFO L146 ILogger]: Abstraction has 179 states and 179 transitions. [2019-05-23 10:04:31,747 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 10:04:31,747 INFO L146 ILogger]: Start isEmpty. Operand 179 states and 179 transitions. [2019-05-23 10:04:31,747 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 179 [2019-05-23 10:04:31,747 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:31,748 INFO L146 ILogger]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:31,748 INFO L146 ILogger]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:31,748 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:31,748 INFO L146 ILogger]: Analyzing trace with hash 1425713433, now seen corresponding path program 86 times [2019-05-23 10:04:31,748 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:31,763 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:31,765 INFO L146 ILogger]: Trace formula consists of 288 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 10:04:31,767 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:34,652 INFO L146 ILogger]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:34,653 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:34,653 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 10:04:34,653 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 10:04:34,654 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 10:04:34,654 INFO L146 ILogger]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 10:04:34,654 INFO L146 ILogger]: Start difference. First operand 179 states and 179 transitions. Second operand 89 states. [2019-05-23 10:04:34,920 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:34,921 INFO L146 ILogger]: Finished difference Result 182 states and 182 transitions. [2019-05-23 10:04:34,921 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 10:04:34,921 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 178 [2019-05-23 10:04:34,921 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:34,922 INFO L146 ILogger]: With dead ends: 182 [2019-05-23 10:04:34,922 INFO L146 ILogger]: Without dead ends: 182 [2019-05-23 10:04:34,923 INFO L146 ILogger]: 0 DeclaredPredicates, 177 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 10:04:34,923 INFO L146 ILogger]: Start minimizeSevpa. Operand 182 states. [2019-05-23 10:04:34,925 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-05-23 10:04:34,925 INFO L146 ILogger]: Start removeUnreachable. Operand 181 states. [2019-05-23 10:04:34,925 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-05-23 10:04:34,926 INFO L146 ILogger]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-05-23 10:04:34,926 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:34,926 INFO L146 ILogger]: Abstraction has 181 states and 181 transitions. [2019-05-23 10:04:34,926 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 10:04:34,926 INFO L146 ILogger]: Start isEmpty. Operand 181 states and 181 transitions. [2019-05-23 10:04:34,926 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 181 [2019-05-23 10:04:34,926 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:34,927 INFO L146 ILogger]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:34,927 INFO L146 ILogger]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:34,927 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:34,927 INFO L146 ILogger]: Analyzing trace with hash -902922569, now seen corresponding path program 87 times [2019-05-23 10:04:34,927 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:34,938 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:34,940 INFO L146 ILogger]: Trace formula consists of 291 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-23 10:04:34,942 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:37,490 INFO L146 ILogger]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:37,490 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:37,490 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 10:04:37,491 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 10:04:37,491 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 10:04:37,492 INFO L146 ILogger]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 10:04:37,492 INFO L146 ILogger]: Start difference. First operand 181 states and 181 transitions. Second operand 90 states. [2019-05-23 10:04:37,752 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:37,752 INFO L146 ILogger]: Finished difference Result 184 states and 184 transitions. [2019-05-23 10:04:37,753 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 10:04:37,753 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 180 [2019-05-23 10:04:37,753 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:37,754 INFO L146 ILogger]: With dead ends: 184 [2019-05-23 10:04:37,754 INFO L146 ILogger]: Without dead ends: 184 [2019-05-23 10:04:37,755 INFO L146 ILogger]: 0 DeclaredPredicates, 179 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 10:04:37,755 INFO L146 ILogger]: Start minimizeSevpa. Operand 184 states. [2019-05-23 10:04:37,757 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-05-23 10:04:37,757 INFO L146 ILogger]: Start removeUnreachable. Operand 183 states. [2019-05-23 10:04:37,757 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-05-23 10:04:37,757 INFO L146 ILogger]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-05-23 10:04:37,757 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:37,757 INFO L146 ILogger]: Abstraction has 183 states and 183 transitions. [2019-05-23 10:04:37,757 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 10:04:37,758 INFO L146 ILogger]: Start isEmpty. Operand 183 states and 183 transitions. [2019-05-23 10:04:37,758 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 183 [2019-05-23 10:04:37,758 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:37,758 INFO L146 ILogger]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:37,758 INFO L146 ILogger]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:37,759 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:37,759 INFO L146 ILogger]: Analyzing trace with hash -1044159275, now seen corresponding path program 88 times [2019-05-23 10:04:37,759 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:37,773 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:37,776 INFO L146 ILogger]: Trace formula consists of 294 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 10:04:37,778 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:40,463 INFO L146 ILogger]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:40,463 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:40,463 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 10:04:40,463 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 10:04:40,464 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 10:04:40,464 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 10:04:40,464 INFO L146 ILogger]: Start difference. First operand 183 states and 183 transitions. Second operand 91 states. [2019-05-23 10:04:40,725 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:40,725 INFO L146 ILogger]: Finished difference Result 186 states and 186 transitions. [2019-05-23 10:04:40,725 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 10:04:40,726 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 182 [2019-05-23 10:04:40,726 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:40,727 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 10:04:40,727 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 10:04:40,727 INFO L146 ILogger]: 0 DeclaredPredicates, 181 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 10:04:40,728 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 10:04:40,730 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-05-23 10:04:40,730 INFO L146 ILogger]: Start removeUnreachable. Operand 185 states. [2019-05-23 10:04:40,730 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-05-23 10:04:40,730 INFO L146 ILogger]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-05-23 10:04:40,731 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:40,731 INFO L146 ILogger]: Abstraction has 185 states and 185 transitions. [2019-05-23 10:04:40,731 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 10:04:40,731 INFO L146 ILogger]: Start isEmpty. Operand 185 states and 185 transitions. [2019-05-23 10:04:40,731 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 185 [2019-05-23 10:04:40,731 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:40,732 INFO L146 ILogger]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:40,732 INFO L146 ILogger]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:40,732 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:40,732 INFO L146 ILogger]: Analyzing trace with hash 666319731, now seen corresponding path program 89 times [2019-05-23 10:04:40,732 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:40,747 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:40,750 INFO L146 ILogger]: Trace formula consists of 297 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-23 10:04:40,753 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:43,422 INFO L146 ILogger]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:43,423 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:43,423 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 10:04:43,423 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 10:04:43,424 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 10:04:43,424 INFO L146 ILogger]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 10:04:43,424 INFO L146 ILogger]: Start difference. First operand 185 states and 185 transitions. Second operand 92 states. [2019-05-23 10:04:43,685 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:43,686 INFO L146 ILogger]: Finished difference Result 188 states and 188 transitions. [2019-05-23 10:04:43,686 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 10:04:43,686 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 184 [2019-05-23 10:04:43,687 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:43,688 INFO L146 ILogger]: With dead ends: 188 [2019-05-23 10:04:43,688 INFO L146 ILogger]: Without dead ends: 188 [2019-05-23 10:04:43,688 INFO L146 ILogger]: 0 DeclaredPredicates, 183 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 10:04:43,689 INFO L146 ILogger]: Start minimizeSevpa. Operand 188 states. [2019-05-23 10:04:43,690 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-05-23 10:04:43,690 INFO L146 ILogger]: Start removeUnreachable. Operand 187 states. [2019-05-23 10:04:43,691 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-05-23 10:04:43,691 INFO L146 ILogger]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-05-23 10:04:43,691 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:43,691 INFO L146 ILogger]: Abstraction has 187 states and 187 transitions. [2019-05-23 10:04:43,691 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 10:04:43,691 INFO L146 ILogger]: Start isEmpty. Operand 187 states and 187 transitions. [2019-05-23 10:04:43,692 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 187 [2019-05-23 10:04:43,692 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:43,692 INFO L146 ILogger]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:43,693 INFO L146 ILogger]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:43,693 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:43,693 INFO L146 ILogger]: Analyzing trace with hash -535829871, now seen corresponding path program 90 times [2019-05-23 10:04:43,693 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:43,707 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:43,710 INFO L146 ILogger]: Trace formula consists of 300 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 10:04:43,712 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:46,482 INFO L146 ILogger]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:46,482 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:46,482 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 10:04:46,482 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 10:04:46,483 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 10:04:46,483 INFO L146 ILogger]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 10:04:46,483 INFO L146 ILogger]: Start difference. First operand 187 states and 187 transitions. Second operand 93 states. [2019-05-23 10:04:46,743 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:46,743 INFO L146 ILogger]: Finished difference Result 190 states and 190 transitions. [2019-05-23 10:04:46,744 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 10:04:46,744 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 186 [2019-05-23 10:04:46,744 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:46,745 INFO L146 ILogger]: With dead ends: 190 [2019-05-23 10:04:46,745 INFO L146 ILogger]: Without dead ends: 190 [2019-05-23 10:04:46,746 INFO L146 ILogger]: 0 DeclaredPredicates, 185 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 10:04:46,746 INFO L146 ILogger]: Start minimizeSevpa. Operand 190 states. [2019-05-23 10:04:46,748 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-05-23 10:04:46,748 INFO L146 ILogger]: Start removeUnreachable. Operand 189 states. [2019-05-23 10:04:46,748 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-05-23 10:04:46,749 INFO L146 ILogger]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-05-23 10:04:46,749 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:46,749 INFO L146 ILogger]: Abstraction has 189 states and 189 transitions. [2019-05-23 10:04:46,749 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 10:04:46,749 INFO L146 ILogger]: Start isEmpty. Operand 189 states and 189 transitions. [2019-05-23 10:04:46,750 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 189 [2019-05-23 10:04:46,750 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:46,750 INFO L146 ILogger]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:46,750 INFO L146 ILogger]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:46,750 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:46,751 INFO L146 ILogger]: Analyzing trace with hash -455394769, now seen corresponding path program 91 times [2019-05-23 10:04:46,751 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:46,765 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:46,768 INFO L146 ILogger]: Trace formula consists of 303 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 10:04:46,769 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:49,584 INFO L146 ILogger]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:49,585 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:49,585 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 10:04:49,585 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 10:04:49,586 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 10:04:49,586 INFO L146 ILogger]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 10:04:49,586 INFO L146 ILogger]: Start difference. First operand 189 states and 189 transitions. Second operand 94 states. [2019-05-23 10:04:49,860 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:49,861 INFO L146 ILogger]: Finished difference Result 192 states and 192 transitions. [2019-05-23 10:04:49,861 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 10:04:49,861 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 188 [2019-05-23 10:04:49,862 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:49,863 INFO L146 ILogger]: With dead ends: 192 [2019-05-23 10:04:49,863 INFO L146 ILogger]: Without dead ends: 192 [2019-05-23 10:04:49,863 INFO L146 ILogger]: 0 DeclaredPredicates, 187 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 10:04:49,864 INFO L146 ILogger]: Start minimizeSevpa. Operand 192 states. [2019-05-23 10:04:49,866 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-05-23 10:04:49,866 INFO L146 ILogger]: Start removeUnreachable. Operand 191 states. [2019-05-23 10:04:49,866 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-05-23 10:04:49,867 INFO L146 ILogger]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-05-23 10:04:49,867 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:49,867 INFO L146 ILogger]: Abstraction has 191 states and 191 transitions. [2019-05-23 10:04:49,867 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 10:04:49,867 INFO L146 ILogger]: Start isEmpty. Operand 191 states and 191 transitions. [2019-05-23 10:04:49,868 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 191 [2019-05-23 10:04:49,868 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:49,868 INFO L146 ILogger]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:49,868 INFO L146 ILogger]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:49,868 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:49,869 INFO L146 ILogger]: Analyzing trace with hash -466673075, now seen corresponding path program 92 times [2019-05-23 10:04:49,869 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:49,880 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:49,882 INFO L146 ILogger]: Trace formula consists of 306 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 10:04:49,883 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:53,221 INFO L146 ILogger]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:53,221 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:53,221 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 10:04:53,221 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 10:04:53,222 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 10:04:53,222 INFO L146 ILogger]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 10:04:53,222 INFO L146 ILogger]: Start difference. First operand 191 states and 191 transitions. Second operand 95 states. [2019-05-23 10:04:53,501 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:53,502 INFO L146 ILogger]: Finished difference Result 194 states and 194 transitions. [2019-05-23 10:04:53,502 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 10:04:53,502 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 190 [2019-05-23 10:04:53,502 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:53,503 INFO L146 ILogger]: With dead ends: 194 [2019-05-23 10:04:53,504 INFO L146 ILogger]: Without dead ends: 194 [2019-05-23 10:04:53,504 INFO L146 ILogger]: 0 DeclaredPredicates, 189 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 10:04:53,505 INFO L146 ILogger]: Start minimizeSevpa. Operand 194 states. [2019-05-23 10:04:53,506 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-05-23 10:04:53,506 INFO L146 ILogger]: Start removeUnreachable. Operand 193 states. [2019-05-23 10:04:53,506 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-05-23 10:04:53,506 INFO L146 ILogger]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-05-23 10:04:53,507 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:53,507 INFO L146 ILogger]: Abstraction has 193 states and 193 transitions. [2019-05-23 10:04:53,507 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 10:04:53,507 INFO L146 ILogger]: Start isEmpty. Operand 193 states and 193 transitions. [2019-05-23 10:04:53,507 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 193 [2019-05-23 10:04:53,507 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:53,507 INFO L146 ILogger]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:53,508 INFO L146 ILogger]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:53,508 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:53,508 INFO L146 ILogger]: Analyzing trace with hash 1579776747, now seen corresponding path program 93 times [2019-05-23 10:04:53,508 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:53,522 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:53,525 INFO L146 ILogger]: Trace formula consists of 309 conjuncts, 95 conjunts are in the unsatisfiable core [2019-05-23 10:04:53,527 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:56,468 INFO L146 ILogger]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:56,469 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:56,469 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 10:04:56,469 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 10:04:56,470 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 10:04:56,470 INFO L146 ILogger]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 10:04:56,470 INFO L146 ILogger]: Start difference. First operand 193 states and 193 transitions. Second operand 96 states. [2019-05-23 10:04:56,761 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:04:56,761 INFO L146 ILogger]: Finished difference Result 196 states and 196 transitions. [2019-05-23 10:04:56,762 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 10:04:56,762 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 192 [2019-05-23 10:04:56,762 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:04:56,763 INFO L146 ILogger]: With dead ends: 196 [2019-05-23 10:04:56,763 INFO L146 ILogger]: Without dead ends: 196 [2019-05-23 10:04:56,764 INFO L146 ILogger]: 0 DeclaredPredicates, 191 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 10:04:56,764 INFO L146 ILogger]: Start minimizeSevpa. Operand 196 states. [2019-05-23 10:04:56,766 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-05-23 10:04:56,766 INFO L146 ILogger]: Start removeUnreachable. Operand 195 states. [2019-05-23 10:04:56,767 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-05-23 10:04:56,767 INFO L146 ILogger]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-05-23 10:04:56,767 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:04:56,767 INFO L146 ILogger]: Abstraction has 195 states and 195 transitions. [2019-05-23 10:04:56,767 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 10:04:56,767 INFO L146 ILogger]: Start isEmpty. Operand 195 states and 195 transitions. [2019-05-23 10:04:56,767 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 195 [2019-05-23 10:04:56,768 INFO L146 ILogger]: Found error trace [2019-05-23 10:04:56,768 INFO L146 ILogger]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1] [2019-05-23 10:04:56,768 INFO L146 ILogger]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:04:56,768 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:04:56,768 INFO L146 ILogger]: Analyzing trace with hash 1123034121, now seen corresponding path program 94 times [2019-05-23 10:04:56,769 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:04:56,784 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:04:56,787 INFO L146 ILogger]: Trace formula consists of 312 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 10:04:56,788 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:04:59,848 INFO L146 ILogger]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:04:59,848 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:04:59,848 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 10:04:59,848 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 10:04:59,849 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 10:04:59,849 INFO L146 ILogger]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 10:04:59,849 INFO L146 ILogger]: Start difference. First operand 195 states and 195 transitions. Second operand 97 states. [2019-05-23 10:05:00,124 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:00,125 INFO L146 ILogger]: Finished difference Result 198 states and 198 transitions. [2019-05-23 10:05:00,125 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 10:05:00,125 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 194 [2019-05-23 10:05:00,125 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:00,126 INFO L146 ILogger]: With dead ends: 198 [2019-05-23 10:05:00,126 INFO L146 ILogger]: Without dead ends: 198 [2019-05-23 10:05:00,127 INFO L146 ILogger]: 0 DeclaredPredicates, 193 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 10:05:00,127 INFO L146 ILogger]: Start minimizeSevpa. Operand 198 states. [2019-05-23 10:05:00,130 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-05-23 10:05:00,130 INFO L146 ILogger]: Start removeUnreachable. Operand 197 states. [2019-05-23 10:05:00,130 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-05-23 10:05:00,130 INFO L146 ILogger]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-05-23 10:05:00,131 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:00,131 INFO L146 ILogger]: Abstraction has 197 states and 197 transitions. [2019-05-23 10:05:00,131 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 10:05:00,131 INFO L146 ILogger]: Start isEmpty. Operand 197 states and 197 transitions. [2019-05-23 10:05:00,132 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 197 [2019-05-23 10:05:00,132 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:00,132 INFO L146 ILogger]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:00,132 INFO L146 ILogger]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:00,132 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:00,132 INFO L146 ILogger]: Analyzing trace with hash 280034727, now seen corresponding path program 95 times [2019-05-23 10:05:00,133 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:00,148 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:00,151 INFO L146 ILogger]: Trace formula consists of 315 conjuncts, 97 conjunts are in the unsatisfiable core [2019-05-23 10:05:00,153 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:03,174 INFO L146 ILogger]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:03,174 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:03,174 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 10:05:03,174 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 10:05:03,175 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 10:05:03,175 INFO L146 ILogger]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 10:05:03,176 INFO L146 ILogger]: Start difference. First operand 197 states and 197 transitions. Second operand 98 states. [2019-05-23 10:05:03,461 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:03,461 INFO L146 ILogger]: Finished difference Result 200 states and 200 transitions. [2019-05-23 10:05:03,461 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 10:05:03,462 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 196 [2019-05-23 10:05:03,462 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:03,463 INFO L146 ILogger]: With dead ends: 200 [2019-05-23 10:05:03,463 INFO L146 ILogger]: Without dead ends: 200 [2019-05-23 10:05:03,464 INFO L146 ILogger]: 0 DeclaredPredicates, 195 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 10:05:03,464 INFO L146 ILogger]: Start minimizeSevpa. Operand 200 states. [2019-05-23 10:05:03,466 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-05-23 10:05:03,466 INFO L146 ILogger]: Start removeUnreachable. Operand 199 states. [2019-05-23 10:05:03,466 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-05-23 10:05:03,466 INFO L146 ILogger]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-05-23 10:05:03,466 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:03,466 INFO L146 ILogger]: Abstraction has 199 states and 199 transitions. [2019-05-23 10:05:03,466 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 10:05:03,466 INFO L146 ILogger]: Start isEmpty. Operand 199 states and 199 transitions. [2019-05-23 10:05:03,467 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 199 [2019-05-23 10:05:03,467 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:03,467 INFO L146 ILogger]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:03,467 INFO L146 ILogger]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:03,468 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:03,468 INFO L146 ILogger]: Analyzing trace with hash 1906436037, now seen corresponding path program 96 times [2019-05-23 10:05:03,468 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:03,484 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:03,486 INFO L146 ILogger]: Trace formula consists of 318 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 10:05:03,489 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:06,612 INFO L146 ILogger]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:06,613 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:06,613 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 10:05:06,613 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 10:05:06,614 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 10:05:06,614 INFO L146 ILogger]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 10:05:06,614 INFO L146 ILogger]: Start difference. First operand 199 states and 199 transitions. Second operand 99 states. [2019-05-23 10:05:06,919 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:06,920 INFO L146 ILogger]: Finished difference Result 202 states and 202 transitions. [2019-05-23 10:05:06,920 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 10:05:06,920 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 198 [2019-05-23 10:05:06,921 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:06,922 INFO L146 ILogger]: With dead ends: 202 [2019-05-23 10:05:06,922 INFO L146 ILogger]: Without dead ends: 202 [2019-05-23 10:05:06,922 INFO L146 ILogger]: 0 DeclaredPredicates, 197 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 10:05:06,923 INFO L146 ILogger]: Start minimizeSevpa. Operand 202 states. [2019-05-23 10:05:06,924 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-05-23 10:05:06,925 INFO L146 ILogger]: Start removeUnreachable. Operand 201 states. [2019-05-23 10:05:06,925 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-05-23 10:05:06,925 INFO L146 ILogger]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-05-23 10:05:06,925 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:06,925 INFO L146 ILogger]: Abstraction has 201 states and 201 transitions. [2019-05-23 10:05:06,925 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 10:05:06,925 INFO L146 ILogger]: Start isEmpty. Operand 201 states and 201 transitions. [2019-05-23 10:05:06,926 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 201 [2019-05-23 10:05:06,926 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:06,926 INFO L146 ILogger]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:06,926 INFO L146 ILogger]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:06,926 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:06,927 INFO L146 ILogger]: Analyzing trace with hash 1509999203, now seen corresponding path program 97 times [2019-05-23 10:05:06,927 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:06,940 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:06,943 INFO L146 ILogger]: Trace formula consists of 321 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 10:05:06,945 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:10,111 INFO L146 ILogger]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:10,111 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:10,111 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 10:05:10,112 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 10:05:10,112 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 10:05:10,112 INFO L146 ILogger]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 10:05:10,112 INFO L146 ILogger]: Start difference. First operand 201 states and 201 transitions. Second operand 100 states. [2019-05-23 10:05:10,441 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:10,441 INFO L146 ILogger]: Finished difference Result 204 states and 204 transitions. [2019-05-23 10:05:10,441 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 10:05:10,442 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 200 [2019-05-23 10:05:10,442 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:10,443 INFO L146 ILogger]: With dead ends: 204 [2019-05-23 10:05:10,443 INFO L146 ILogger]: Without dead ends: 204 [2019-05-23 10:05:10,444 INFO L146 ILogger]: 0 DeclaredPredicates, 199 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 10:05:10,444 INFO L146 ILogger]: Start minimizeSevpa. Operand 204 states. [2019-05-23 10:05:10,446 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-05-23 10:05:10,446 INFO L146 ILogger]: Start removeUnreachable. Operand 203 states. [2019-05-23 10:05:10,446 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-05-23 10:05:10,446 INFO L146 ILogger]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-05-23 10:05:10,446 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:10,446 INFO L146 ILogger]: Abstraction has 203 states and 203 transitions. [2019-05-23 10:05:10,446 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 10:05:10,446 INFO L146 ILogger]: Start isEmpty. Operand 203 states and 203 transitions. [2019-05-23 10:05:10,447 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 203 [2019-05-23 10:05:10,447 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:10,447 INFO L146 ILogger]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:10,447 INFO L146 ILogger]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:10,447 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:10,448 INFO L146 ILogger]: Analyzing trace with hash -1508676223, now seen corresponding path program 98 times [2019-05-23 10:05:10,448 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:10,461 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:10,464 INFO L146 ILogger]: Trace formula consists of 324 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 10:05:10,466 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:13,712 INFO L146 ILogger]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:13,713 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:13,713 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 10:05:13,713 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 10:05:13,713 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 10:05:13,714 INFO L146 ILogger]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 10:05:13,714 INFO L146 ILogger]: Start difference. First operand 203 states and 203 transitions. Second operand 101 states. [2019-05-23 10:05:14,042 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:14,043 INFO L146 ILogger]: Finished difference Result 206 states and 206 transitions. [2019-05-23 10:05:14,043 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 10:05:14,043 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 202 [2019-05-23 10:05:14,044 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:14,045 INFO L146 ILogger]: With dead ends: 206 [2019-05-23 10:05:14,045 INFO L146 ILogger]: Without dead ends: 206 [2019-05-23 10:05:14,045 INFO L146 ILogger]: 0 DeclaredPredicates, 201 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 10:05:14,046 INFO L146 ILogger]: Start minimizeSevpa. Operand 206 states. [2019-05-23 10:05:14,047 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-05-23 10:05:14,048 INFO L146 ILogger]: Start removeUnreachable. Operand 205 states. [2019-05-23 10:05:14,048 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-05-23 10:05:14,048 INFO L146 ILogger]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-05-23 10:05:14,048 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:14,048 INFO L146 ILogger]: Abstraction has 205 states and 205 transitions. [2019-05-23 10:05:14,048 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 10:05:14,049 INFO L146 ILogger]: Start isEmpty. Operand 205 states and 205 transitions. [2019-05-23 10:05:14,049 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 205 [2019-05-23 10:05:14,049 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:14,049 INFO L146 ILogger]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:14,049 INFO L146 ILogger]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:14,050 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:14,050 INFO L146 ILogger]: Analyzing trace with hash 942131487, now seen corresponding path program 99 times [2019-05-23 10:05:14,050 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:14,063 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:14,066 INFO L146 ILogger]: Trace formula consists of 327 conjuncts, 101 conjunts are in the unsatisfiable core [2019-05-23 10:05:14,068 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:17,377 INFO L146 ILogger]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:17,377 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:17,377 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 10:05:17,377 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 10:05:17,378 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 10:05:17,378 INFO L146 ILogger]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 10:05:17,379 INFO L146 ILogger]: Start difference. First operand 205 states and 205 transitions. Second operand 102 states. [2019-05-23 10:05:17,709 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:17,709 INFO L146 ILogger]: Finished difference Result 208 states and 208 transitions. [2019-05-23 10:05:17,709 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 10:05:17,710 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 204 [2019-05-23 10:05:17,710 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:17,711 INFO L146 ILogger]: With dead ends: 208 [2019-05-23 10:05:17,711 INFO L146 ILogger]: Without dead ends: 208 [2019-05-23 10:05:17,712 INFO L146 ILogger]: 0 DeclaredPredicates, 203 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 10:05:17,712 INFO L146 ILogger]: Start minimizeSevpa. Operand 208 states. [2019-05-23 10:05:17,714 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-05-23 10:05:17,714 INFO L146 ILogger]: Start removeUnreachable. Operand 207 states. [2019-05-23 10:05:17,714 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-05-23 10:05:17,714 INFO L146 ILogger]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-05-23 10:05:17,715 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:17,715 INFO L146 ILogger]: Abstraction has 207 states and 207 transitions. [2019-05-23 10:05:17,715 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 10:05:17,715 INFO L146 ILogger]: Start isEmpty. Operand 207 states and 207 transitions. [2019-05-23 10:05:17,715 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 207 [2019-05-23 10:05:17,716 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:17,716 INFO L146 ILogger]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:17,716 INFO L146 ILogger]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:17,716 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:17,716 INFO L146 ILogger]: Analyzing trace with hash -1768704707, now seen corresponding path program 100 times [2019-05-23 10:05:17,717 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:17,730 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:17,733 INFO L146 ILogger]: Trace formula consists of 330 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 10:05:17,735 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:21,050 INFO L146 ILogger]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:21,051 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:21,051 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-05-23 10:05:21,051 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 10:05:21,052 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 10:05:21,052 INFO L146 ILogger]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 10:05:21,052 INFO L146 ILogger]: Start difference. First operand 207 states and 207 transitions. Second operand 103 states. [2019-05-23 10:05:21,412 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:21,413 INFO L146 ILogger]: Finished difference Result 210 states and 210 transitions. [2019-05-23 10:05:21,413 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 10:05:21,413 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 206 [2019-05-23 10:05:21,413 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:21,414 INFO L146 ILogger]: With dead ends: 210 [2019-05-23 10:05:21,415 INFO L146 ILogger]: Without dead ends: 210 [2019-05-23 10:05:21,415 INFO L146 ILogger]: 0 DeclaredPredicates, 205 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 10:05:21,416 INFO L146 ILogger]: Start minimizeSevpa. Operand 210 states. [2019-05-23 10:05:21,418 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-05-23 10:05:21,418 INFO L146 ILogger]: Start removeUnreachable. Operand 209 states. [2019-05-23 10:05:21,418 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-05-23 10:05:21,418 INFO L146 ILogger]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-05-23 10:05:21,419 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:21,419 INFO L146 ILogger]: Abstraction has 209 states and 209 transitions. [2019-05-23 10:05:21,419 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 10:05:21,419 INFO L146 ILogger]: Start isEmpty. Operand 209 states and 209 transitions. [2019-05-23 10:05:21,419 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 209 [2019-05-23 10:05:21,419 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:21,420 INFO L146 ILogger]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:21,420 INFO L146 ILogger]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:21,420 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:21,420 INFO L146 ILogger]: Analyzing trace with hash 162861531, now seen corresponding path program 101 times [2019-05-23 10:05:21,420 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:21,431 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:21,434 INFO L146 ILogger]: Trace formula consists of 333 conjuncts, 103 conjunts are in the unsatisfiable core [2019-05-23 10:05:21,435 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:24,832 INFO L146 ILogger]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:24,832 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:24,832 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 10:05:24,832 INFO L146 ILogger]: Interpolant automaton has 104 states [2019-05-23 10:05:24,833 INFO L146 ILogger]: Constructing interpolant automaton starting with 104 interpolants. [2019-05-23 10:05:24,834 INFO L146 ILogger]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 10:05:24,834 INFO L146 ILogger]: Start difference. First operand 209 states and 209 transitions. Second operand 104 states. [2019-05-23 10:05:25,158 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:25,159 INFO L146 ILogger]: Finished difference Result 212 states and 212 transitions. [2019-05-23 10:05:25,159 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-05-23 10:05:25,159 INFO L146 ILogger]: Start accepts. Automaton has 104 states. Word has length 208 [2019-05-23 10:05:25,159 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:25,161 INFO L146 ILogger]: With dead ends: 212 [2019-05-23 10:05:25,161 INFO L146 ILogger]: Without dead ends: 212 [2019-05-23 10:05:25,162 INFO L146 ILogger]: 0 DeclaredPredicates, 207 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 10:05:25,162 INFO L146 ILogger]: Start minimizeSevpa. Operand 212 states. [2019-05-23 10:05:25,164 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-05-23 10:05:25,164 INFO L146 ILogger]: Start removeUnreachable. Operand 211 states. [2019-05-23 10:05:25,165 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-05-23 10:05:25,165 INFO L146 ILogger]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-05-23 10:05:25,165 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:25,165 INFO L146 ILogger]: Abstraction has 211 states and 211 transitions. [2019-05-23 10:05:25,165 INFO L146 ILogger]: Interpolant automaton has 104 states. [2019-05-23 10:05:25,165 INFO L146 ILogger]: Start isEmpty. Operand 211 states and 211 transitions. [2019-05-23 10:05:25,166 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 211 [2019-05-23 10:05:25,166 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:25,166 INFO L146 ILogger]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:25,166 INFO L146 ILogger]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:25,167 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:25,167 INFO L146 ILogger]: Analyzing trace with hash 972144377, now seen corresponding path program 102 times [2019-05-23 10:05:25,167 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:25,179 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:25,182 INFO L146 ILogger]: Trace formula consists of 336 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 10:05:25,184 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:28,842 INFO L146 ILogger]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:28,842 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:28,842 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-05-23 10:05:28,842 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 10:05:28,843 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 10:05:28,843 INFO L146 ILogger]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 10:05:28,843 INFO L146 ILogger]: Start difference. First operand 211 states and 211 transitions. Second operand 105 states. [2019-05-23 10:05:29,204 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:29,204 INFO L146 ILogger]: Finished difference Result 214 states and 214 transitions. [2019-05-23 10:05:29,205 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 10:05:29,205 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 210 [2019-05-23 10:05:29,205 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:29,206 INFO L146 ILogger]: With dead ends: 214 [2019-05-23 10:05:29,206 INFO L146 ILogger]: Without dead ends: 214 [2019-05-23 10:05:29,207 INFO L146 ILogger]: 0 DeclaredPredicates, 209 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 10:05:29,207 INFO L146 ILogger]: Start minimizeSevpa. Operand 214 states. [2019-05-23 10:05:29,210 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-05-23 10:05:29,210 INFO L146 ILogger]: Start removeUnreachable. Operand 213 states. [2019-05-23 10:05:29,210 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-05-23 10:05:29,210 INFO L146 ILogger]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2019-05-23 10:05:29,210 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:29,211 INFO L146 ILogger]: Abstraction has 213 states and 213 transitions. [2019-05-23 10:05:29,211 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 10:05:29,211 INFO L146 ILogger]: Start isEmpty. Operand 213 states and 213 transitions. [2019-05-23 10:05:29,212 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 213 [2019-05-23 10:05:29,212 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:29,212 INFO L146 ILogger]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:29,212 INFO L146 ILogger]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:29,212 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:29,212 INFO L146 ILogger]: Analyzing trace with hash 1303878807, now seen corresponding path program 103 times [2019-05-23 10:05:29,213 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:29,227 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:29,229 INFO L146 ILogger]: Trace formula consists of 339 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 10:05:29,231 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:32,819 INFO L146 ILogger]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:32,819 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:32,819 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 10:05:32,820 INFO L146 ILogger]: Interpolant automaton has 106 states [2019-05-23 10:05:32,821 INFO L146 ILogger]: Constructing interpolant automaton starting with 106 interpolants. [2019-05-23 10:05:32,821 INFO L146 ILogger]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 10:05:32,821 INFO L146 ILogger]: Start difference. First operand 213 states and 213 transitions. Second operand 106 states. [2019-05-23 10:05:33,160 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:33,160 INFO L146 ILogger]: Finished difference Result 216 states and 216 transitions. [2019-05-23 10:05:33,161 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-05-23 10:05:33,161 INFO L146 ILogger]: Start accepts. Automaton has 106 states. Word has length 212 [2019-05-23 10:05:33,161 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:33,162 INFO L146 ILogger]: With dead ends: 216 [2019-05-23 10:05:33,162 INFO L146 ILogger]: Without dead ends: 216 [2019-05-23 10:05:33,163 INFO L146 ILogger]: 0 DeclaredPredicates, 211 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 10:05:33,163 INFO L146 ILogger]: Start minimizeSevpa. Operand 216 states. [2019-05-23 10:05:33,165 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-05-23 10:05:33,165 INFO L146 ILogger]: Start removeUnreachable. Operand 215 states. [2019-05-23 10:05:33,165 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-05-23 10:05:33,166 INFO L146 ILogger]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2019-05-23 10:05:33,166 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:33,166 INFO L146 ILogger]: Abstraction has 215 states and 215 transitions. [2019-05-23 10:05:33,166 INFO L146 ILogger]: Interpolant automaton has 106 states. [2019-05-23 10:05:33,166 INFO L146 ILogger]: Start isEmpty. Operand 215 states and 215 transitions. [2019-05-23 10:05:33,166 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 215 [2019-05-23 10:05:33,166 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:33,167 INFO L146 ILogger]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:33,167 INFO L146 ILogger]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:33,167 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:33,167 INFO L146 ILogger]: Analyzing trace with hash -2021881163, now seen corresponding path program 104 times [2019-05-23 10:05:33,167 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:33,179 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:33,182 INFO L146 ILogger]: Trace formula consists of 342 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 10:05:33,183 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:36,914 INFO L146 ILogger]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:36,915 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:36,915 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-05-23 10:05:36,915 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 10:05:36,916 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 10:05:36,916 INFO L146 ILogger]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 10:05:36,916 INFO L146 ILogger]: Start difference. First operand 215 states and 215 transitions. Second operand 107 states. [2019-05-23 10:05:37,231 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:37,232 INFO L146 ILogger]: Finished difference Result 218 states and 218 transitions. [2019-05-23 10:05:37,232 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-05-23 10:05:37,232 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 214 [2019-05-23 10:05:37,232 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:37,233 INFO L146 ILogger]: With dead ends: 218 [2019-05-23 10:05:37,233 INFO L146 ILogger]: Without dead ends: 218 [2019-05-23 10:05:37,234 INFO L146 ILogger]: 0 DeclaredPredicates, 213 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 10:05:37,234 INFO L146 ILogger]: Start minimizeSevpa. Operand 218 states. [2019-05-23 10:05:37,236 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-05-23 10:05:37,237 INFO L146 ILogger]: Start removeUnreachable. Operand 217 states. [2019-05-23 10:05:37,237 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-05-23 10:05:37,237 INFO L146 ILogger]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2019-05-23 10:05:37,237 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:37,237 INFO L146 ILogger]: Abstraction has 217 states and 217 transitions. [2019-05-23 10:05:37,238 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 10:05:37,238 INFO L146 ILogger]: Start isEmpty. Operand 217 states and 217 transitions. [2019-05-23 10:05:37,238 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 217 [2019-05-23 10:05:37,238 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:37,239 INFO L146 ILogger]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:37,239 INFO L146 ILogger]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:37,239 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:37,239 INFO L146 ILogger]: Analyzing trace with hash 1673423187, now seen corresponding path program 105 times [2019-05-23 10:05:37,240 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:37,253 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:37,256 INFO L146 ILogger]: Trace formula consists of 345 conjuncts, 107 conjunts are in the unsatisfiable core [2019-05-23 10:05:37,267 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:40,938 INFO L146 ILogger]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:40,938 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:40,938 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 10:05:40,939 INFO L146 ILogger]: Interpolant automaton has 108 states [2019-05-23 10:05:40,939 INFO L146 ILogger]: Constructing interpolant automaton starting with 108 interpolants. [2019-05-23 10:05:40,940 INFO L146 ILogger]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 10:05:40,940 INFO L146 ILogger]: Start difference. First operand 217 states and 217 transitions. Second operand 108 states. [2019-05-23 10:05:41,286 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:41,286 INFO L146 ILogger]: Finished difference Result 220 states and 220 transitions. [2019-05-23 10:05:41,287 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 10:05:41,287 INFO L146 ILogger]: Start accepts. Automaton has 108 states. Word has length 216 [2019-05-23 10:05:41,287 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:41,288 INFO L146 ILogger]: With dead ends: 220 [2019-05-23 10:05:41,288 INFO L146 ILogger]: Without dead ends: 220 [2019-05-23 10:05:41,289 INFO L146 ILogger]: 0 DeclaredPredicates, 215 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 10:05:41,289 INFO L146 ILogger]: Start minimizeSevpa. Operand 220 states. [2019-05-23 10:05:41,291 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-05-23 10:05:41,291 INFO L146 ILogger]: Start removeUnreachable. Operand 219 states. [2019-05-23 10:05:41,291 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-05-23 10:05:41,291 INFO L146 ILogger]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2019-05-23 10:05:41,292 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:41,292 INFO L146 ILogger]: Abstraction has 219 states and 219 transitions. [2019-05-23 10:05:41,292 INFO L146 ILogger]: Interpolant automaton has 108 states. [2019-05-23 10:05:41,292 INFO L146 ILogger]: Start isEmpty. Operand 219 states and 219 transitions. [2019-05-23 10:05:41,293 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 219 [2019-05-23 10:05:41,293 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:41,293 INFO L146 ILogger]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:41,293 INFO L146 ILogger]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:41,293 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:41,293 INFO L146 ILogger]: Analyzing trace with hash 922949745, now seen corresponding path program 106 times [2019-05-23 10:05:41,294 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:41,306 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:41,308 INFO L146 ILogger]: Trace formula consists of 348 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 10:05:41,309 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:45,029 INFO L146 ILogger]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:45,030 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:45,030 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-05-23 10:05:45,030 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 10:05:45,031 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 10:05:45,031 INFO L146 ILogger]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 10:05:45,031 INFO L146 ILogger]: Start difference. First operand 219 states and 219 transitions. Second operand 109 states. [2019-05-23 10:05:45,357 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:45,358 INFO L146 ILogger]: Finished difference Result 222 states and 222 transitions. [2019-05-23 10:05:45,358 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-05-23 10:05:45,358 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 218 [2019-05-23 10:05:45,359 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:45,359 INFO L146 ILogger]: With dead ends: 222 [2019-05-23 10:05:45,359 INFO L146 ILogger]: Without dead ends: 222 [2019-05-23 10:05:45,360 INFO L146 ILogger]: 0 DeclaredPredicates, 217 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 10:05:45,360 INFO L146 ILogger]: Start minimizeSevpa. Operand 222 states. [2019-05-23 10:05:45,362 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-05-23 10:05:45,362 INFO L146 ILogger]: Start removeUnreachable. Operand 221 states. [2019-05-23 10:05:45,362 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-05-23 10:05:45,362 INFO L146 ILogger]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2019-05-23 10:05:45,363 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:45,363 INFO L146 ILogger]: Abstraction has 221 states and 221 transitions. [2019-05-23 10:05:45,363 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 10:05:45,363 INFO L146 ILogger]: Start isEmpty. Operand 221 states and 221 transitions. [2019-05-23 10:05:45,364 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 221 [2019-05-23 10:05:45,364 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:45,364 INFO L146 ILogger]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:45,364 INFO L146 ILogger]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:45,364 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:45,364 INFO L146 ILogger]: Analyzing trace with hash 1272477711, now seen corresponding path program 107 times [2019-05-23 10:05:45,365 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:45,378 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:45,380 INFO L146 ILogger]: Trace formula consists of 351 conjuncts, 109 conjunts are in the unsatisfiable core [2019-05-23 10:05:45,382 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:49,198 INFO L146 ILogger]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:49,199 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:49,199 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 10:05:49,199 INFO L146 ILogger]: Interpolant automaton has 110 states [2019-05-23 10:05:49,200 INFO L146 ILogger]: Constructing interpolant automaton starting with 110 interpolants. [2019-05-23 10:05:49,200 INFO L146 ILogger]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 10:05:49,200 INFO L146 ILogger]: Start difference. First operand 221 states and 221 transitions. Second operand 110 states. [2019-05-23 10:05:49,512 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:49,512 INFO L146 ILogger]: Finished difference Result 224 states and 224 transitions. [2019-05-23 10:05:49,513 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-05-23 10:05:49,513 INFO L146 ILogger]: Start accepts. Automaton has 110 states. Word has length 220 [2019-05-23 10:05:49,513 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:49,514 INFO L146 ILogger]: With dead ends: 224 [2019-05-23 10:05:49,514 INFO L146 ILogger]: Without dead ends: 224 [2019-05-23 10:05:49,515 INFO L146 ILogger]: 0 DeclaredPredicates, 219 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 10:05:49,515 INFO L146 ILogger]: Start minimizeSevpa. Operand 224 states. [2019-05-23 10:05:49,516 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-05-23 10:05:49,516 INFO L146 ILogger]: Start removeUnreachable. Operand 223 states. [2019-05-23 10:05:49,516 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-05-23 10:05:49,516 INFO L146 ILogger]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2019-05-23 10:05:49,517 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:49,517 INFO L146 ILogger]: Abstraction has 223 states and 223 transitions. [2019-05-23 10:05:49,517 INFO L146 ILogger]: Interpolant automaton has 110 states. [2019-05-23 10:05:49,517 INFO L146 ILogger]: Start isEmpty. Operand 223 states and 223 transitions. [2019-05-23 10:05:49,517 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 223 [2019-05-23 10:05:49,517 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:49,517 INFO L146 ILogger]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:49,518 INFO L146 ILogger]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:49,518 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:49,518 INFO L146 ILogger]: Analyzing trace with hash -2133563347, now seen corresponding path program 108 times [2019-05-23 10:05:49,519 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:49,530 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:49,532 INFO L146 ILogger]: Trace formula consists of 354 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 10:05:49,534 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:53,372 INFO L146 ILogger]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:53,372 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:53,372 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-05-23 10:05:53,373 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 10:05:53,373 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 10:05:53,374 INFO L146 ILogger]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 10:05:53,374 INFO L146 ILogger]: Start difference. First operand 223 states and 223 transitions. Second operand 111 states. [2019-05-23 10:05:53,744 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:53,744 INFO L146 ILogger]: Finished difference Result 226 states and 226 transitions. [2019-05-23 10:05:53,745 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 10:05:53,745 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 222 [2019-05-23 10:05:53,745 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:53,746 INFO L146 ILogger]: With dead ends: 226 [2019-05-23 10:05:53,746 INFO L146 ILogger]: Without dead ends: 226 [2019-05-23 10:05:53,746 INFO L146 ILogger]: 0 DeclaredPredicates, 221 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 10:05:53,747 INFO L146 ILogger]: Start minimizeSevpa. Operand 226 states. [2019-05-23 10:05:53,748 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-05-23 10:05:53,748 INFO L146 ILogger]: Start removeUnreachable. Operand 225 states. [2019-05-23 10:05:53,749 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-05-23 10:05:53,749 INFO L146 ILogger]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2019-05-23 10:05:53,749 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:53,749 INFO L146 ILogger]: Abstraction has 225 states and 225 transitions. [2019-05-23 10:05:53,749 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 10:05:53,749 INFO L146 ILogger]: Start isEmpty. Operand 225 states and 225 transitions. [2019-05-23 10:05:53,750 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 225 [2019-05-23 10:05:53,750 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:53,750 INFO L146 ILogger]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:53,750 INFO L146 ILogger]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:53,750 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:53,751 INFO L146 ILogger]: Analyzing trace with hash 1721026763, now seen corresponding path program 109 times [2019-05-23 10:05:53,751 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:53,762 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:53,765 INFO L146 ILogger]: Trace formula consists of 357 conjuncts, 111 conjunts are in the unsatisfiable core [2019-05-23 10:05:53,766 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:05:57,790 INFO L146 ILogger]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:05:57,791 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:05:57,791 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 10:05:57,791 INFO L146 ILogger]: Interpolant automaton has 112 states [2019-05-23 10:05:57,792 INFO L146 ILogger]: Constructing interpolant automaton starting with 112 interpolants. [2019-05-23 10:05:57,792 INFO L146 ILogger]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 10:05:57,792 INFO L146 ILogger]: Start difference. First operand 225 states and 225 transitions. Second operand 112 states. [2019-05-23 10:05:58,146 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:05:58,146 INFO L146 ILogger]: Finished difference Result 228 states and 228 transitions. [2019-05-23 10:05:58,147 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-05-23 10:05:58,147 INFO L146 ILogger]: Start accepts. Automaton has 112 states. Word has length 224 [2019-05-23 10:05:58,147 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:05:58,148 INFO L146 ILogger]: With dead ends: 228 [2019-05-23 10:05:58,148 INFO L146 ILogger]: Without dead ends: 228 [2019-05-23 10:05:58,148 INFO L146 ILogger]: 0 DeclaredPredicates, 223 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 10:05:58,149 INFO L146 ILogger]: Start minimizeSevpa. Operand 228 states. [2019-05-23 10:05:58,151 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-05-23 10:05:58,151 INFO L146 ILogger]: Start removeUnreachable. Operand 227 states. [2019-05-23 10:05:58,151 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-05-23 10:05:58,151 INFO L146 ILogger]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2019-05-23 10:05:58,151 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:05:58,152 INFO L146 ILogger]: Abstraction has 227 states and 227 transitions. [2019-05-23 10:05:58,152 INFO L146 ILogger]: Interpolant automaton has 112 states. [2019-05-23 10:05:58,152 INFO L146 ILogger]: Start isEmpty. Operand 227 states and 227 transitions. [2019-05-23 10:05:58,152 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 227 [2019-05-23 10:05:58,152 INFO L146 ILogger]: Found error trace [2019-05-23 10:05:58,152 INFO L146 ILogger]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1] [2019-05-23 10:05:58,153 INFO L146 ILogger]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:05:58,153 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:05:58,153 INFO L146 ILogger]: Analyzing trace with hash -574653975, now seen corresponding path program 110 times [2019-05-23 10:05:58,153 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:05:58,165 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:05:58,168 INFO L146 ILogger]: Trace formula consists of 360 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 10:05:58,169 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:02,141 INFO L146 ILogger]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:02,141 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:02,141 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-05-23 10:06:02,141 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 10:06:02,142 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 10:06:02,142 INFO L146 ILogger]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 10:06:02,142 INFO L146 ILogger]: Start difference. First operand 227 states and 227 transitions. Second operand 113 states. [2019-05-23 10:06:02,490 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:02,490 INFO L146 ILogger]: Finished difference Result 230 states and 230 transitions. [2019-05-23 10:06:02,490 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-05-23 10:06:02,490 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 226 [2019-05-23 10:06:02,491 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:02,491 INFO L146 ILogger]: With dead ends: 230 [2019-05-23 10:06:02,491 INFO L146 ILogger]: Without dead ends: 230 [2019-05-23 10:06:02,492 INFO L146 ILogger]: 0 DeclaredPredicates, 225 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 10:06:02,492 INFO L146 ILogger]: Start minimizeSevpa. Operand 230 states. [2019-05-23 10:06:02,494 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-05-23 10:06:02,494 INFO L146 ILogger]: Start removeUnreachable. Operand 229 states. [2019-05-23 10:06:02,494 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-05-23 10:06:02,495 INFO L146 ILogger]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2019-05-23 10:06:02,495 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:02,495 INFO L146 ILogger]: Abstraction has 229 states and 229 transitions. [2019-05-23 10:06:02,495 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 10:06:02,495 INFO L146 ILogger]: Start isEmpty. Operand 229 states and 229 transitions. [2019-05-23 10:06:02,496 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 229 [2019-05-23 10:06:02,496 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:02,496 INFO L146 ILogger]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:02,496 INFO L146 ILogger]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:02,496 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:02,496 INFO L146 ILogger]: Analyzing trace with hash 889346951, now seen corresponding path program 111 times [2019-05-23 10:06:02,497 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:02,510 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:02,512 INFO L146 ILogger]: Trace formula consists of 363 conjuncts, 113 conjunts are in the unsatisfiable core [2019-05-23 10:06:02,513 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:06,535 INFO L146 ILogger]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:06,535 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:06,535 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 10:06:06,535 INFO L146 ILogger]: Interpolant automaton has 114 states [2019-05-23 10:06:06,536 INFO L146 ILogger]: Constructing interpolant automaton starting with 114 interpolants. [2019-05-23 10:06:06,536 INFO L146 ILogger]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 10:06:06,536 INFO L146 ILogger]: Start difference. First operand 229 states and 229 transitions. Second operand 114 states. [2019-05-23 10:06:06,881 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:06,881 INFO L146 ILogger]: Finished difference Result 232 states and 232 transitions. [2019-05-23 10:06:06,881 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 10:06:06,881 INFO L146 ILogger]: Start accepts. Automaton has 114 states. Word has length 228 [2019-05-23 10:06:06,882 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:06,882 INFO L146 ILogger]: With dead ends: 232 [2019-05-23 10:06:06,882 INFO L146 ILogger]: Without dead ends: 232 [2019-05-23 10:06:06,883 INFO L146 ILogger]: 0 DeclaredPredicates, 227 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 10:06:06,883 INFO L146 ILogger]: Start minimizeSevpa. Operand 232 states. [2019-05-23 10:06:06,885 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-05-23 10:06:06,885 INFO L146 ILogger]: Start removeUnreachable. Operand 231 states. [2019-05-23 10:06:06,885 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-05-23 10:06:06,886 INFO L146 ILogger]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2019-05-23 10:06:06,886 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:06,886 INFO L146 ILogger]: Abstraction has 231 states and 231 transitions. [2019-05-23 10:06:06,886 INFO L146 ILogger]: Interpolant automaton has 114 states. [2019-05-23 10:06:06,886 INFO L146 ILogger]: Start isEmpty. Operand 231 states and 231 transitions. [2019-05-23 10:06:06,887 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 231 [2019-05-23 10:06:06,887 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:06,887 INFO L146 ILogger]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:06,887 INFO L146 ILogger]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:06,888 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:06,888 INFO L146 ILogger]: Analyzing trace with hash -955036251, now seen corresponding path program 112 times [2019-05-23 10:06:06,888 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:06,902 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:06,904 INFO L146 ILogger]: Trace formula consists of 366 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 10:06:06,905 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:11,064 INFO L146 ILogger]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:11,064 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:11,064 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-05-23 10:06:11,065 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 10:06:11,065 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 10:06:11,066 INFO L146 ILogger]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 10:06:11,066 INFO L146 ILogger]: Start difference. First operand 231 states and 231 transitions. Second operand 115 states. [2019-05-23 10:06:11,405 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:11,406 INFO L146 ILogger]: Finished difference Result 234 states and 234 transitions. [2019-05-23 10:06:11,406 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-05-23 10:06:11,406 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 230 [2019-05-23 10:06:11,406 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:11,407 INFO L146 ILogger]: With dead ends: 234 [2019-05-23 10:06:11,407 INFO L146 ILogger]: Without dead ends: 234 [2019-05-23 10:06:11,408 INFO L146 ILogger]: 0 DeclaredPredicates, 229 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 10:06:11,408 INFO L146 ILogger]: Start minimizeSevpa. Operand 234 states. [2019-05-23 10:06:11,409 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-05-23 10:06:11,409 INFO L146 ILogger]: Start removeUnreachable. Operand 233 states. [2019-05-23 10:06:11,410 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-05-23 10:06:11,410 INFO L146 ILogger]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2019-05-23 10:06:11,410 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:11,410 INFO L146 ILogger]: Abstraction has 233 states and 233 transitions. [2019-05-23 10:06:11,410 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 10:06:11,410 INFO L146 ILogger]: Start isEmpty. Operand 233 states and 233 transitions. [2019-05-23 10:06:11,410 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 233 [2019-05-23 10:06:11,411 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:11,411 INFO L146 ILogger]: trace histogram [113, 113, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:11,411 INFO L146 ILogger]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:11,411 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:11,411 INFO L146 ILogger]: Analyzing trace with hash 414199875, now seen corresponding path program 113 times [2019-05-23 10:06:11,411 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:11,423 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:11,425 INFO L146 ILogger]: Trace formula consists of 369 conjuncts, 115 conjunts are in the unsatisfiable core [2019-05-23 10:06:11,426 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:15,654 INFO L146 ILogger]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:15,655 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:15,655 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 10:06:15,655 INFO L146 ILogger]: Interpolant automaton has 116 states [2019-05-23 10:06:15,656 INFO L146 ILogger]: Constructing interpolant automaton starting with 116 interpolants. [2019-05-23 10:06:15,656 INFO L146 ILogger]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 10:06:15,656 INFO L146 ILogger]: Start difference. First operand 233 states and 233 transitions. Second operand 116 states. [2019-05-23 10:06:16,009 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:16,009 INFO L146 ILogger]: Finished difference Result 236 states and 236 transitions. [2019-05-23 10:06:16,010 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-05-23 10:06:16,010 INFO L146 ILogger]: Start accepts. Automaton has 116 states. Word has length 232 [2019-05-23 10:06:16,010 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:16,011 INFO L146 ILogger]: With dead ends: 236 [2019-05-23 10:06:16,011 INFO L146 ILogger]: Without dead ends: 236 [2019-05-23 10:06:16,011 INFO L146 ILogger]: 0 DeclaredPredicates, 231 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 10:06:16,012 INFO L146 ILogger]: Start minimizeSevpa. Operand 236 states. [2019-05-23 10:06:16,013 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-05-23 10:06:16,013 INFO L146 ILogger]: Start removeUnreachable. Operand 235 states. [2019-05-23 10:06:16,014 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-05-23 10:06:16,014 INFO L146 ILogger]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2019-05-23 10:06:16,014 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:16,014 INFO L146 ILogger]: Abstraction has 235 states and 235 transitions. [2019-05-23 10:06:16,014 INFO L146 ILogger]: Interpolant automaton has 116 states. [2019-05-23 10:06:16,014 INFO L146 ILogger]: Start isEmpty. Operand 235 states and 235 transitions. [2019-05-23 10:06:16,015 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 235 [2019-05-23 10:06:16,015 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:16,015 INFO L146 ILogger]: trace histogram [114, 114, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:16,015 INFO L146 ILogger]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:16,015 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:16,015 INFO L146 ILogger]: Analyzing trace with hash 1990124385, now seen corresponding path program 114 times [2019-05-23 10:06:16,016 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:16,029 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:16,031 INFO L146 ILogger]: Trace formula consists of 372 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 10:06:16,032 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:20,314 INFO L146 ILogger]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:20,315 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:20,315 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-05-23 10:06:20,315 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 10:06:20,316 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 10:06:20,316 INFO L146 ILogger]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 10:06:20,316 INFO L146 ILogger]: Start difference. First operand 235 states and 235 transitions. Second operand 117 states. [2019-05-23 10:06:20,670 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:20,670 INFO L146 ILogger]: Finished difference Result 238 states and 238 transitions. [2019-05-23 10:06:20,671 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 10:06:20,671 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 234 [2019-05-23 10:06:20,671 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:20,671 INFO L146 ILogger]: With dead ends: 238 [2019-05-23 10:06:20,672 INFO L146 ILogger]: Without dead ends: 238 [2019-05-23 10:06:20,672 INFO L146 ILogger]: 0 DeclaredPredicates, 233 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 10:06:20,673 INFO L146 ILogger]: Start minimizeSevpa. Operand 238 states. [2019-05-23 10:06:20,674 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-05-23 10:06:20,674 INFO L146 ILogger]: Start removeUnreachable. Operand 237 states. [2019-05-23 10:06:20,674 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-05-23 10:06:20,675 INFO L146 ILogger]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2019-05-23 10:06:20,675 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:20,675 INFO L146 ILogger]: Abstraction has 237 states and 237 transitions. [2019-05-23 10:06:20,675 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 10:06:20,675 INFO L146 ILogger]: Start isEmpty. Operand 237 states and 237 transitions. [2019-05-23 10:06:20,676 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 237 [2019-05-23 10:06:20,676 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:20,676 INFO L146 ILogger]: trace histogram [115, 115, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:20,676 INFO L146 ILogger]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:20,676 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:20,676 INFO L146 ILogger]: Analyzing trace with hash 330123007, now seen corresponding path program 115 times [2019-05-23 10:06:20,677 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:20,689 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:20,691 INFO L146 ILogger]: Trace formula consists of 375 conjuncts, 117 conjunts are in the unsatisfiable core [2019-05-23 10:06:20,692 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:25,047 INFO L146 ILogger]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:25,047 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:25,048 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 10:06:25,048 INFO L146 ILogger]: Interpolant automaton has 118 states [2019-05-23 10:06:25,048 INFO L146 ILogger]: Constructing interpolant automaton starting with 118 interpolants. [2019-05-23 10:06:25,049 INFO L146 ILogger]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 10:06:25,049 INFO L146 ILogger]: Start difference. First operand 237 states and 237 transitions. Second operand 118 states. [2019-05-23 10:06:25,405 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:25,406 INFO L146 ILogger]: Finished difference Result 240 states and 240 transitions. [2019-05-23 10:06:25,406 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-05-23 10:06:25,406 INFO L146 ILogger]: Start accepts. Automaton has 118 states. Word has length 236 [2019-05-23 10:06:25,407 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:25,407 INFO L146 ILogger]: With dead ends: 240 [2019-05-23 10:06:25,407 INFO L146 ILogger]: Without dead ends: 240 [2019-05-23 10:06:25,408 INFO L146 ILogger]: 0 DeclaredPredicates, 235 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 10:06:25,408 INFO L146 ILogger]: Start minimizeSevpa. Operand 240 states. [2019-05-23 10:06:25,410 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-05-23 10:06:25,410 INFO L146 ILogger]: Start removeUnreachable. Operand 239 states. [2019-05-23 10:06:25,410 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-05-23 10:06:25,410 INFO L146 ILogger]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2019-05-23 10:06:25,411 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:25,411 INFO L146 ILogger]: Abstraction has 239 states and 239 transitions. [2019-05-23 10:06:25,411 INFO L146 ILogger]: Interpolant automaton has 118 states. [2019-05-23 10:06:25,411 INFO L146 ILogger]: Start isEmpty. Operand 239 states and 239 transitions. [2019-05-23 10:06:25,412 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 239 [2019-05-23 10:06:25,412 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:25,412 INFO L146 ILogger]: trace histogram [116, 116, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:25,412 INFO L146 ILogger]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:25,412 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:25,412 INFO L146 ILogger]: Analyzing trace with hash -1498334435, now seen corresponding path program 116 times [2019-05-23 10:06:25,412 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:25,424 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:25,426 INFO L146 ILogger]: Trace formula consists of 378 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 10:06:25,427 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:29,856 INFO L146 ILogger]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:29,856 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:29,856 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-05-23 10:06:29,856 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 10:06:29,857 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 10:06:29,857 INFO L146 ILogger]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 10:06:29,857 INFO L146 ILogger]: Start difference. First operand 239 states and 239 transitions. Second operand 119 states. [2019-05-23 10:06:30,225 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:30,226 INFO L146 ILogger]: Finished difference Result 242 states and 242 transitions. [2019-05-23 10:06:30,226 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-05-23 10:06:30,226 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 238 [2019-05-23 10:06:30,227 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:30,227 INFO L146 ILogger]: With dead ends: 242 [2019-05-23 10:06:30,227 INFO L146 ILogger]: Without dead ends: 242 [2019-05-23 10:06:30,228 INFO L146 ILogger]: 0 DeclaredPredicates, 237 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 10:06:30,228 INFO L146 ILogger]: Start minimizeSevpa. Operand 242 states. [2019-05-23 10:06:30,229 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-05-23 10:06:30,230 INFO L146 ILogger]: Start removeUnreachable. Operand 241 states. [2019-05-23 10:06:30,230 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-05-23 10:06:30,230 INFO L146 ILogger]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2019-05-23 10:06:30,230 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:30,231 INFO L146 ILogger]: Abstraction has 241 states and 241 transitions. [2019-05-23 10:06:30,231 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 10:06:30,231 INFO L146 ILogger]: Start isEmpty. Operand 241 states and 241 transitions. [2019-05-23 10:06:30,231 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 241 [2019-05-23 10:06:30,231 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:30,231 INFO L146 ILogger]: trace histogram [117, 117, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:30,232 INFO L146 ILogger]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:30,232 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:30,232 INFO L146 ILogger]: Analyzing trace with hash -2004312133, now seen corresponding path program 117 times [2019-05-23 10:06:30,232 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:30,244 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:30,246 INFO L146 ILogger]: Trace formula consists of 381 conjuncts, 119 conjunts are in the unsatisfiable core [2019-05-23 10:06:30,247 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:34,725 INFO L146 ILogger]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:34,725 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:34,725 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 10:06:34,725 INFO L146 ILogger]: Interpolant automaton has 120 states [2019-05-23 10:06:34,726 INFO L146 ILogger]: Constructing interpolant automaton starting with 120 interpolants. [2019-05-23 10:06:34,726 INFO L146 ILogger]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 10:06:34,726 INFO L146 ILogger]: Start difference. First operand 241 states and 241 transitions. Second operand 120 states. [2019-05-23 10:06:35,112 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:35,113 INFO L146 ILogger]: Finished difference Result 244 states and 244 transitions. [2019-05-23 10:06:35,113 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 10:06:35,113 INFO L146 ILogger]: Start accepts. Automaton has 120 states. Word has length 240 [2019-05-23 10:06:35,114 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:35,114 INFO L146 ILogger]: With dead ends: 244 [2019-05-23 10:06:35,114 INFO L146 ILogger]: Without dead ends: 244 [2019-05-23 10:06:35,115 INFO L146 ILogger]: 0 DeclaredPredicates, 239 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 10:06:35,115 INFO L146 ILogger]: Start minimizeSevpa. Operand 244 states. [2019-05-23 10:06:35,117 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 244 to 243. [2019-05-23 10:06:35,117 INFO L146 ILogger]: Start removeUnreachable. Operand 243 states. [2019-05-23 10:06:35,117 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-05-23 10:06:35,117 INFO L146 ILogger]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2019-05-23 10:06:35,117 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:35,117 INFO L146 ILogger]: Abstraction has 243 states and 243 transitions. [2019-05-23 10:06:35,118 INFO L146 ILogger]: Interpolant automaton has 120 states. [2019-05-23 10:06:35,118 INFO L146 ILogger]: Start isEmpty. Operand 243 states and 243 transitions. [2019-05-23 10:06:35,118 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 243 [2019-05-23 10:06:35,118 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:35,119 INFO L146 ILogger]: trace histogram [118, 118, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:35,119 INFO L146 ILogger]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:35,119 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:35,119 INFO L146 ILogger]: Analyzing trace with hash 1377391833, now seen corresponding path program 118 times [2019-05-23 10:06:35,119 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:35,132 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:35,134 INFO L146 ILogger]: Trace formula consists of 384 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 10:06:35,135 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:39,731 INFO L146 ILogger]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:39,732 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:39,732 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-05-23 10:06:39,732 INFO L146 ILogger]: Interpolant automaton has 121 states [2019-05-23 10:06:39,733 INFO L146 ILogger]: Constructing interpolant automaton starting with 121 interpolants. [2019-05-23 10:06:39,733 INFO L146 ILogger]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 10:06:39,733 INFO L146 ILogger]: Start difference. First operand 243 states and 243 transitions. Second operand 121 states. [2019-05-23 10:06:40,140 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:40,140 INFO L146 ILogger]: Finished difference Result 246 states and 246 transitions. [2019-05-23 10:06:40,140 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-05-23 10:06:40,141 INFO L146 ILogger]: Start accepts. Automaton has 121 states. Word has length 242 [2019-05-23 10:06:40,141 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:40,141 INFO L146 ILogger]: With dead ends: 246 [2019-05-23 10:06:40,142 INFO L146 ILogger]: Without dead ends: 246 [2019-05-23 10:06:40,143 INFO L146 ILogger]: 0 DeclaredPredicates, 241 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 10:06:40,143 INFO L146 ILogger]: Start minimizeSevpa. Operand 246 states. [2019-05-23 10:06:40,145 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-05-23 10:06:40,145 INFO L146 ILogger]: Start removeUnreachable. Operand 245 states. [2019-05-23 10:06:40,146 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-05-23 10:06:40,146 INFO L146 ILogger]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2019-05-23 10:06:40,146 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:40,146 INFO L146 ILogger]: Abstraction has 245 states and 245 transitions. [2019-05-23 10:06:40,146 INFO L146 ILogger]: Interpolant automaton has 121 states. [2019-05-23 10:06:40,146 INFO L146 ILogger]: Start isEmpty. Operand 245 states and 245 transitions. [2019-05-23 10:06:40,147 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 245 [2019-05-23 10:06:40,147 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:40,147 INFO L146 ILogger]: trace histogram [119, 119, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:40,147 INFO L146 ILogger]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:40,147 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:40,147 INFO L146 ILogger]: Analyzing trace with hash -95339913, now seen corresponding path program 119 times [2019-05-23 10:06:40,148 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:40,160 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:40,162 INFO L146 ILogger]: Trace formula consists of 387 conjuncts, 121 conjunts are in the unsatisfiable core [2019-05-23 10:06:40,163 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:44,770 INFO L146 ILogger]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:44,771 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:44,771 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 10:06:44,771 INFO L146 ILogger]: Interpolant automaton has 122 states [2019-05-23 10:06:44,772 INFO L146 ILogger]: Constructing interpolant automaton starting with 122 interpolants. [2019-05-23 10:06:44,772 INFO L146 ILogger]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 10:06:44,772 INFO L146 ILogger]: Start difference. First operand 245 states and 245 transitions. Second operand 122 states. [2019-05-23 10:06:45,148 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:45,149 INFO L146 ILogger]: Finished difference Result 248 states and 248 transitions. [2019-05-23 10:06:45,149 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-05-23 10:06:45,149 INFO L146 ILogger]: Start accepts. Automaton has 122 states. Word has length 244 [2019-05-23 10:06:45,149 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:45,150 INFO L146 ILogger]: With dead ends: 248 [2019-05-23 10:06:45,150 INFO L146 ILogger]: Without dead ends: 248 [2019-05-23 10:06:45,151 INFO L146 ILogger]: 0 DeclaredPredicates, 243 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 10:06:45,151 INFO L146 ILogger]: Start minimizeSevpa. Operand 248 states. [2019-05-23 10:06:45,153 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-05-23 10:06:45,154 INFO L146 ILogger]: Start removeUnreachable. Operand 247 states. [2019-05-23 10:06:45,154 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-05-23 10:06:45,154 INFO L146 ILogger]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2019-05-23 10:06:45,154 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:45,154 INFO L146 ILogger]: Abstraction has 247 states and 247 transitions. [2019-05-23 10:06:45,154 INFO L146 ILogger]: Interpolant automaton has 122 states. [2019-05-23 10:06:45,154 INFO L146 ILogger]: Start isEmpty. Operand 247 states and 247 transitions. [2019-05-23 10:06:45,155 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 247 [2019-05-23 10:06:45,155 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:45,155 INFO L146 ILogger]: trace histogram [120, 120, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:45,155 INFO L146 ILogger]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:45,155 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:45,155 INFO L146 ILogger]: Analyzing trace with hash 1948659861, now seen corresponding path program 120 times [2019-05-23 10:06:45,156 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:45,168 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:45,170 INFO L146 ILogger]: Trace formula consists of 390 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 10:06:45,171 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:49,893 INFO L146 ILogger]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:49,893 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:49,893 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-05-23 10:06:49,893 INFO L146 ILogger]: Interpolant automaton has 123 states [2019-05-23 10:06:49,894 INFO L146 ILogger]: Constructing interpolant automaton starting with 123 interpolants. [2019-05-23 10:06:49,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 10:06:49,894 INFO L146 ILogger]: Start difference. First operand 247 states and 247 transitions. Second operand 123 states. [2019-05-23 10:06:50,277 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:50,277 INFO L146 ILogger]: Finished difference Result 250 states and 250 transitions. [2019-05-23 10:06:50,277 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-05-23 10:06:50,277 INFO L146 ILogger]: Start accepts. Automaton has 123 states. Word has length 246 [2019-05-23 10:06:50,278 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:50,278 INFO L146 ILogger]: With dead ends: 250 [2019-05-23 10:06:50,278 INFO L146 ILogger]: Without dead ends: 250 [2019-05-23 10:06:50,279 INFO L146 ILogger]: 0 DeclaredPredicates, 245 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 10:06:50,279 INFO L146 ILogger]: Start minimizeSevpa. Operand 250 states. [2019-05-23 10:06:50,281 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-05-23 10:06:50,281 INFO L146 ILogger]: Start removeUnreachable. Operand 249 states. [2019-05-23 10:06:50,282 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-05-23 10:06:50,282 INFO L146 ILogger]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2019-05-23 10:06:50,282 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:50,282 INFO L146 ILogger]: Abstraction has 249 states and 249 transitions. [2019-05-23 10:06:50,282 INFO L146 ILogger]: Interpolant automaton has 123 states. [2019-05-23 10:06:50,282 INFO L146 ILogger]: Start isEmpty. Operand 249 states and 249 transitions. [2019-05-23 10:06:50,283 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 249 [2019-05-23 10:06:50,283 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:50,283 INFO L146 ILogger]: trace histogram [121, 121, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:50,283 INFO L146 ILogger]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:50,283 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:50,283 INFO L146 ILogger]: Analyzing trace with hash -862578893, now seen corresponding path program 121 times [2019-05-23 10:06:50,284 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:50,296 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:50,298 INFO L146 ILogger]: Trace formula consists of 393 conjuncts, 123 conjunts are in the unsatisfiable core [2019-05-23 10:06:50,300 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:06:55,167 INFO L146 ILogger]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:06:55,167 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:06:55,167 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 10:06:55,167 INFO L146 ILogger]: Interpolant automaton has 124 states [2019-05-23 10:06:55,168 INFO L146 ILogger]: Constructing interpolant automaton starting with 124 interpolants. [2019-05-23 10:06:55,168 INFO L146 ILogger]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 10:06:55,169 INFO L146 ILogger]: Start difference. First operand 249 states and 249 transitions. Second operand 124 states. [2019-05-23 10:06:55,572 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:06:55,573 INFO L146 ILogger]: Finished difference Result 252 states and 252 transitions. [2019-05-23 10:06:55,573 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-05-23 10:06:55,573 INFO L146 ILogger]: Start accepts. Automaton has 124 states. Word has length 248 [2019-05-23 10:06:55,574 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:06:55,574 INFO L146 ILogger]: With dead ends: 252 [2019-05-23 10:06:55,574 INFO L146 ILogger]: Without dead ends: 252 [2019-05-23 10:06:55,575 INFO L146 ILogger]: 0 DeclaredPredicates, 247 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 10:06:55,575 INFO L146 ILogger]: Start minimizeSevpa. Operand 252 states. [2019-05-23 10:06:55,576 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-05-23 10:06:55,576 INFO L146 ILogger]: Start removeUnreachable. Operand 251 states. [2019-05-23 10:06:55,577 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-05-23 10:06:55,577 INFO L146 ILogger]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2019-05-23 10:06:55,577 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:06:55,577 INFO L146 ILogger]: Abstraction has 251 states and 251 transitions. [2019-05-23 10:06:55,577 INFO L146 ILogger]: Interpolant automaton has 124 states. [2019-05-23 10:06:55,577 INFO L146 ILogger]: Start isEmpty. Operand 251 states and 251 transitions. [2019-05-23 10:06:55,578 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 251 [2019-05-23 10:06:55,578 INFO L146 ILogger]: Found error trace [2019-05-23 10:06:55,578 INFO L146 ILogger]: trace histogram [122, 122, 1, 1, 1, 1, 1, 1] [2019-05-23 10:06:55,578 INFO L146 ILogger]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:06:55,578 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:06:55,578 INFO L146 ILogger]: Analyzing trace with hash -928592303, now seen corresponding path program 122 times [2019-05-23 10:06:55,579 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:06:55,592 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:06:55,594 INFO L146 ILogger]: Trace formula consists of 396 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 10:06:55,595 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:00,501 INFO L146 ILogger]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:00,502 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:00,502 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2019-05-23 10:07:00,502 INFO L146 ILogger]: Interpolant automaton has 125 states [2019-05-23 10:07:00,503 INFO L146 ILogger]: Constructing interpolant automaton starting with 125 interpolants. [2019-05-23 10:07:00,503 INFO L146 ILogger]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 10:07:00,503 INFO L146 ILogger]: Start difference. First operand 251 states and 251 transitions. Second operand 125 states. [2019-05-23 10:07:00,893 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:00,893 INFO L146 ILogger]: Finished difference Result 254 states and 254 transitions. [2019-05-23 10:07:00,893 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-05-23 10:07:00,893 INFO L146 ILogger]: Start accepts. Automaton has 125 states. Word has length 250 [2019-05-23 10:07:00,894 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:00,894 INFO L146 ILogger]: With dead ends: 254 [2019-05-23 10:07:00,894 INFO L146 ILogger]: Without dead ends: 254 [2019-05-23 10:07:00,895 INFO L146 ILogger]: 0 DeclaredPredicates, 249 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 10:07:00,895 INFO L146 ILogger]: Start minimizeSevpa. Operand 254 states. [2019-05-23 10:07:00,897 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-05-23 10:07:00,897 INFO L146 ILogger]: Start removeUnreachable. Operand 253 states. [2019-05-23 10:07:00,897 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-05-23 10:07:00,898 INFO L146 ILogger]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2019-05-23 10:07:00,898 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:00,898 INFO L146 ILogger]: Abstraction has 253 states and 253 transitions. [2019-05-23 10:07:00,898 INFO L146 ILogger]: Interpolant automaton has 125 states. [2019-05-23 10:07:00,898 INFO L146 ILogger]: Start isEmpty. Operand 253 states and 253 transitions. [2019-05-23 10:07:00,899 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 253 [2019-05-23 10:07:00,899 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:00,899 INFO L146 ILogger]: trace histogram [123, 123, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:00,899 INFO L146 ILogger]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:00,899 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:00,899 INFO L146 ILogger]: Analyzing trace with hash 57030127, now seen corresponding path program 123 times [2019-05-23 10:07:00,900 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:00,913 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:00,915 INFO L146 ILogger]: Trace formula consists of 399 conjuncts, 125 conjunts are in the unsatisfiable core [2019-05-23 10:07:00,917 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:05,898 INFO L146 ILogger]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:05,898 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:05,898 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 10:07:05,899 INFO L146 ILogger]: Interpolant automaton has 126 states [2019-05-23 10:07:05,899 INFO L146 ILogger]: Constructing interpolant automaton starting with 126 interpolants. [2019-05-23 10:07:05,900 INFO L146 ILogger]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 10:07:05,900 INFO L146 ILogger]: Start difference. First operand 253 states and 253 transitions. Second operand 126 states. [2019-05-23 10:07:06,297 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:06,297 INFO L146 ILogger]: Finished difference Result 256 states and 256 transitions. [2019-05-23 10:07:06,297 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 10:07:06,298 INFO L146 ILogger]: Start accepts. Automaton has 126 states. Word has length 252 [2019-05-23 10:07:06,298 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:06,298 INFO L146 ILogger]: With dead ends: 256 [2019-05-23 10:07:06,298 INFO L146 ILogger]: Without dead ends: 256 [2019-05-23 10:07:06,299 INFO L146 ILogger]: 0 DeclaredPredicates, 251 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 10:07:06,299 INFO L146 ILogger]: Start minimizeSevpa. Operand 256 states. [2019-05-23 10:07:06,301 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-05-23 10:07:06,301 INFO L146 ILogger]: Start removeUnreachable. Operand 255 states. [2019-05-23 10:07:06,302 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-05-23 10:07:06,302 INFO L146 ILogger]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2019-05-23 10:07:06,302 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:06,302 INFO L146 ILogger]: Abstraction has 255 states and 255 transitions. [2019-05-23 10:07:06,302 INFO L146 ILogger]: Interpolant automaton has 126 states. [2019-05-23 10:07:06,302 INFO L146 ILogger]: Start isEmpty. Operand 255 states and 255 transitions. [2019-05-23 10:07:06,303 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 255 [2019-05-23 10:07:06,303 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:06,303 INFO L146 ILogger]: trace histogram [124, 124, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:06,303 INFO L146 ILogger]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:06,303 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:06,303 INFO L146 ILogger]: Analyzing trace with hash -1947587059, now seen corresponding path program 124 times [2019-05-23 10:07:06,304 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:06,317 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:06,319 INFO L146 ILogger]: Trace formula consists of 402 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 10:07:06,321 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:11,365 INFO L146 ILogger]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:11,365 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:11,366 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2019-05-23 10:07:11,366 INFO L146 ILogger]: Interpolant automaton has 127 states [2019-05-23 10:07:11,366 INFO L146 ILogger]: Constructing interpolant automaton starting with 127 interpolants. [2019-05-23 10:07:11,367 INFO L146 ILogger]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 10:07:11,367 INFO L146 ILogger]: Start difference. First operand 255 states and 255 transitions. Second operand 127 states. [2019-05-23 10:07:11,737 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:11,738 INFO L146 ILogger]: Finished difference Result 258 states and 258 transitions. [2019-05-23 10:07:11,738 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-05-23 10:07:11,738 INFO L146 ILogger]: Start accepts. Automaton has 127 states. Word has length 254 [2019-05-23 10:07:11,739 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:11,739 INFO L146 ILogger]: With dead ends: 258 [2019-05-23 10:07:11,739 INFO L146 ILogger]: Without dead ends: 258 [2019-05-23 10:07:11,740 INFO L146 ILogger]: 0 DeclaredPredicates, 253 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 10:07:11,740 INFO L146 ILogger]: Start minimizeSevpa. Operand 258 states. [2019-05-23 10:07:11,742 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-05-23 10:07:11,743 INFO L146 ILogger]: Start removeUnreachable. Operand 257 states. [2019-05-23 10:07:11,743 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-05-23 10:07:11,743 INFO L146 ILogger]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2019-05-23 10:07:11,743 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:11,743 INFO L146 ILogger]: Abstraction has 257 states and 257 transitions. [2019-05-23 10:07:11,744 INFO L146 ILogger]: Interpolant automaton has 127 states. [2019-05-23 10:07:11,744 INFO L146 ILogger]: Start isEmpty. Operand 257 states and 257 transitions. [2019-05-23 10:07:11,744 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 257 [2019-05-23 10:07:11,745 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:11,745 INFO L146 ILogger]: trace histogram [125, 125, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:11,745 INFO L146 ILogger]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:11,745 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:11,745 INFO L146 ILogger]: Analyzing trace with hash 55613099, now seen corresponding path program 125 times [2019-05-23 10:07:11,746 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:11,759 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:11,761 INFO L146 ILogger]: Trace formula consists of 405 conjuncts, 127 conjunts are in the unsatisfiable core [2019-05-23 10:07:11,762 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:16,837 INFO L146 ILogger]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:16,838 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:16,838 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 10:07:16,838 INFO L146 ILogger]: Interpolant automaton has 128 states [2019-05-23 10:07:16,839 INFO L146 ILogger]: Constructing interpolant automaton starting with 128 interpolants. [2019-05-23 10:07:16,839 INFO L146 ILogger]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 10:07:16,840 INFO L146 ILogger]: Start difference. First operand 257 states and 257 transitions. Second operand 128 states. [2019-05-23 10:07:17,253 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:17,253 INFO L146 ILogger]: Finished difference Result 260 states and 260 transitions. [2019-05-23 10:07:17,254 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-05-23 10:07:17,254 INFO L146 ILogger]: Start accepts. Automaton has 128 states. Word has length 256 [2019-05-23 10:07:17,254 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:17,255 INFO L146 ILogger]: With dead ends: 260 [2019-05-23 10:07:17,255 INFO L146 ILogger]: Without dead ends: 260 [2019-05-23 10:07:17,256 INFO L146 ILogger]: 0 DeclaredPredicates, 255 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 10:07:17,256 INFO L146 ILogger]: Start minimizeSevpa. Operand 260 states. [2019-05-23 10:07:17,259 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-05-23 10:07:17,259 INFO L146 ILogger]: Start removeUnreachable. Operand 259 states. [2019-05-23 10:07:17,259 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-05-23 10:07:17,259 INFO L146 ILogger]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2019-05-23 10:07:17,260 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:17,260 INFO L146 ILogger]: Abstraction has 259 states and 259 transitions. [2019-05-23 10:07:17,260 INFO L146 ILogger]: Interpolant automaton has 128 states. [2019-05-23 10:07:17,260 INFO L146 ILogger]: Start isEmpty. Operand 259 states and 259 transitions. [2019-05-23 10:07:17,261 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 259 [2019-05-23 10:07:17,261 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:17,261 INFO L146 ILogger]: trace histogram [126, 126, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:17,261 INFO L146 ILogger]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:17,261 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:17,262 INFO L146 ILogger]: Analyzing trace with hash 985616329, now seen corresponding path program 126 times [2019-05-23 10:07:17,262 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:17,280 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:17,283 INFO L146 ILogger]: Trace formula consists of 408 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 10:07:17,285 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:22,422 INFO L146 ILogger]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:22,423 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:22,423 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2019-05-23 10:07:22,423 INFO L146 ILogger]: Interpolant automaton has 129 states [2019-05-23 10:07:22,424 INFO L146 ILogger]: Constructing interpolant automaton starting with 129 interpolants. [2019-05-23 10:07:22,424 INFO L146 ILogger]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 10:07:22,425 INFO L146 ILogger]: Start difference. First operand 259 states and 259 transitions. Second operand 129 states. [2019-05-23 10:07:22,814 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:22,814 INFO L146 ILogger]: Finished difference Result 262 states and 262 transitions. [2019-05-23 10:07:22,814 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-05-23 10:07:22,815 INFO L146 ILogger]: Start accepts. Automaton has 129 states. Word has length 258 [2019-05-23 10:07:22,815 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:22,815 INFO L146 ILogger]: With dead ends: 262 [2019-05-23 10:07:22,816 INFO L146 ILogger]: Without dead ends: 262 [2019-05-23 10:07:22,816 INFO L146 ILogger]: 0 DeclaredPredicates, 257 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 10:07:22,817 INFO L146 ILogger]: Start minimizeSevpa. Operand 262 states. [2019-05-23 10:07:22,818 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-05-23 10:07:22,818 INFO L146 ILogger]: Start removeUnreachable. Operand 261 states. [2019-05-23 10:07:22,819 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-05-23 10:07:22,819 INFO L146 ILogger]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2019-05-23 10:07:22,819 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:22,819 INFO L146 ILogger]: Abstraction has 261 states and 261 transitions. [2019-05-23 10:07:22,819 INFO L146 ILogger]: Interpolant automaton has 129 states. [2019-05-23 10:07:22,819 INFO L146 ILogger]: Start isEmpty. Operand 261 states and 261 transitions. [2019-05-23 10:07:22,820 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 261 [2019-05-23 10:07:22,820 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:22,820 INFO L146 ILogger]: trace histogram [127, 127, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:22,821 INFO L146 ILogger]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:22,821 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:22,821 INFO L146 ILogger]: Analyzing trace with hash 1365522791, now seen corresponding path program 127 times [2019-05-23 10:07:22,822 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:22,837 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:22,840 INFO L146 ILogger]: Trace formula consists of 411 conjuncts, 129 conjunts are in the unsatisfiable core [2019-05-23 10:07:22,841 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:28,124 INFO L146 ILogger]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:28,125 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:28,125 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 10:07:28,125 INFO L146 ILogger]: Interpolant automaton has 130 states [2019-05-23 10:07:28,126 INFO L146 ILogger]: Constructing interpolant automaton starting with 130 interpolants. [2019-05-23 10:07:28,127 INFO L146 ILogger]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 10:07:28,127 INFO L146 ILogger]: Start difference. First operand 261 states and 261 transitions. Second operand 130 states. [2019-05-23 10:07:28,547 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:28,547 INFO L146 ILogger]: Finished difference Result 264 states and 264 transitions. [2019-05-23 10:07:28,548 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-05-23 10:07:28,548 INFO L146 ILogger]: Start accepts. Automaton has 130 states. Word has length 260 [2019-05-23 10:07:28,548 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:28,549 INFO L146 ILogger]: With dead ends: 264 [2019-05-23 10:07:28,549 INFO L146 ILogger]: Without dead ends: 264 [2019-05-23 10:07:28,550 INFO L146 ILogger]: 0 DeclaredPredicates, 259 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 10:07:28,551 INFO L146 ILogger]: Start minimizeSevpa. Operand 264 states. [2019-05-23 10:07:28,552 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-05-23 10:07:28,552 INFO L146 ILogger]: Start removeUnreachable. Operand 263 states. [2019-05-23 10:07:28,553 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-05-23 10:07:28,553 INFO L146 ILogger]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2019-05-23 10:07:28,553 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:28,553 INFO L146 ILogger]: Abstraction has 263 states and 263 transitions. [2019-05-23 10:07:28,553 INFO L146 ILogger]: Interpolant automaton has 130 states. [2019-05-23 10:07:28,553 INFO L146 ILogger]: Start isEmpty. Operand 263 states and 263 transitions. [2019-05-23 10:07:28,554 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 263 [2019-05-23 10:07:28,554 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:28,554 INFO L146 ILogger]: trace histogram [128, 128, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:28,554 INFO L146 ILogger]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:28,555 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:28,555 INFO L146 ILogger]: Analyzing trace with hash 1383412613, now seen corresponding path program 128 times [2019-05-23 10:07:28,555 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:28,570 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:28,572 INFO L146 ILogger]: Trace formula consists of 414 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 10:07:28,573 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:33,939 INFO L146 ILogger]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:33,939 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:33,940 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-05-23 10:07:33,940 INFO L146 ILogger]: Interpolant automaton has 131 states [2019-05-23 10:07:33,941 INFO L146 ILogger]: Constructing interpolant automaton starting with 131 interpolants. [2019-05-23 10:07:33,941 INFO L146 ILogger]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 10:07:33,941 INFO L146 ILogger]: Start difference. First operand 263 states and 263 transitions. Second operand 131 states. [2019-05-23 10:07:34,355 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:34,355 INFO L146 ILogger]: Finished difference Result 266 states and 266 transitions. [2019-05-23 10:07:34,355 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-05-23 10:07:34,355 INFO L146 ILogger]: Start accepts. Automaton has 131 states. Word has length 262 [2019-05-23 10:07:34,356 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:34,356 INFO L146 ILogger]: With dead ends: 266 [2019-05-23 10:07:34,356 INFO L146 ILogger]: Without dead ends: 266 [2019-05-23 10:07:34,357 INFO L146 ILogger]: 0 DeclaredPredicates, 261 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 10:07:34,358 INFO L146 ILogger]: Start minimizeSevpa. Operand 266 states. [2019-05-23 10:07:34,359 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-05-23 10:07:34,359 INFO L146 ILogger]: Start removeUnreachable. Operand 265 states. [2019-05-23 10:07:34,360 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-05-23 10:07:34,360 INFO L146 ILogger]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2019-05-23 10:07:34,360 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:34,360 INFO L146 ILogger]: Abstraction has 265 states and 265 transitions. [2019-05-23 10:07:34,361 INFO L146 ILogger]: Interpolant automaton has 131 states. [2019-05-23 10:07:34,361 INFO L146 ILogger]: Start isEmpty. Operand 265 states and 265 transitions. [2019-05-23 10:07:34,361 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 265 [2019-05-23 10:07:34,361 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:34,361 INFO L146 ILogger]: trace histogram [129, 129, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:34,362 INFO L146 ILogger]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:34,362 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:34,362 INFO L146 ILogger]: Analyzing trace with hash 1395662371, now seen corresponding path program 129 times [2019-05-23 10:07:34,362 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:34,377 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:34,380 INFO L146 ILogger]: Trace formula consists of 417 conjuncts, 131 conjunts are in the unsatisfiable core [2019-05-23 10:07:34,381 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:39,805 INFO L146 ILogger]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:39,805 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:39,805 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 10:07:39,806 INFO L146 ILogger]: Interpolant automaton has 132 states [2019-05-23 10:07:39,806 INFO L146 ILogger]: Constructing interpolant automaton starting with 132 interpolants. [2019-05-23 10:07:39,807 INFO L146 ILogger]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 10:07:39,807 INFO L146 ILogger]: Start difference. First operand 265 states and 265 transitions. Second operand 132 states. [2019-05-23 10:07:40,204 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:40,204 INFO L146 ILogger]: Finished difference Result 268 states and 268 transitions. [2019-05-23 10:07:40,204 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-05-23 10:07:40,205 INFO L146 ILogger]: Start accepts. Automaton has 132 states. Word has length 264 [2019-05-23 10:07:40,205 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:40,205 INFO L146 ILogger]: With dead ends: 268 [2019-05-23 10:07:40,206 INFO L146 ILogger]: Without dead ends: 268 [2019-05-23 10:07:40,207 INFO L146 ILogger]: 0 DeclaredPredicates, 263 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 10:07:40,207 INFO L146 ILogger]: Start minimizeSevpa. Operand 268 states. [2019-05-23 10:07:40,209 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 268 to 267. [2019-05-23 10:07:40,209 INFO L146 ILogger]: Start removeUnreachable. Operand 267 states. [2019-05-23 10:07:40,209 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-05-23 10:07:40,209 INFO L146 ILogger]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2019-05-23 10:07:40,209 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:40,209 INFO L146 ILogger]: Abstraction has 267 states and 267 transitions. [2019-05-23 10:07:40,210 INFO L146 ILogger]: Interpolant automaton has 132 states. [2019-05-23 10:07:40,210 INFO L146 ILogger]: Start isEmpty. Operand 267 states and 267 transitions. [2019-05-23 10:07:40,210 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 267 [2019-05-23 10:07:40,210 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:40,210 INFO L146 ILogger]: trace histogram [130, 130, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:40,211 INFO L146 ILogger]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:40,211 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:40,211 INFO L146 ILogger]: Analyzing trace with hash 282777921, now seen corresponding path program 130 times [2019-05-23 10:07:40,211 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:40,226 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:40,228 INFO L146 ILogger]: Trace formula consists of 420 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 10:07:40,230 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:45,756 INFO L146 ILogger]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:45,756 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:45,757 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2019-05-23 10:07:45,757 INFO L146 ILogger]: Interpolant automaton has 133 states [2019-05-23 10:07:45,757 INFO L146 ILogger]: Constructing interpolant automaton starting with 133 interpolants. [2019-05-23 10:07:45,758 INFO L146 ILogger]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 10:07:45,758 INFO L146 ILogger]: Start difference. First operand 267 states and 267 transitions. Second operand 133 states. [2019-05-23 10:07:46,188 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:46,188 INFO L146 ILogger]: Finished difference Result 270 states and 270 transitions. [2019-05-23 10:07:46,189 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-05-23 10:07:46,189 INFO L146 ILogger]: Start accepts. Automaton has 133 states. Word has length 266 [2019-05-23 10:07:46,189 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:46,190 INFO L146 ILogger]: With dead ends: 270 [2019-05-23 10:07:46,190 INFO L146 ILogger]: Without dead ends: 270 [2019-05-23 10:07:46,190 INFO L146 ILogger]: 0 DeclaredPredicates, 265 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 10:07:46,191 INFO L146 ILogger]: Start minimizeSevpa. Operand 270 states. [2019-05-23 10:07:46,192 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-05-23 10:07:46,193 INFO L146 ILogger]: Start removeUnreachable. Operand 269 states. [2019-05-23 10:07:46,193 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-05-23 10:07:46,193 INFO L146 ILogger]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2019-05-23 10:07:46,193 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:46,193 INFO L146 ILogger]: Abstraction has 269 states and 269 transitions. [2019-05-23 10:07:46,193 INFO L146 ILogger]: Interpolant automaton has 133 states. [2019-05-23 10:07:46,193 INFO L146 ILogger]: Start isEmpty. Operand 269 states and 269 transitions. [2019-05-23 10:07:46,194 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 269 [2019-05-23 10:07:46,194 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:46,194 INFO L146 ILogger]: trace histogram [131, 131, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:46,194 INFO L146 ILogger]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:46,194 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:46,195 INFO L146 ILogger]: Analyzing trace with hash 247678175, now seen corresponding path program 131 times [2019-05-23 10:07:46,195 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:46,209 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:46,212 INFO L146 ILogger]: Trace formula consists of 423 conjuncts, 133 conjunts are in the unsatisfiable core [2019-05-23 10:07:46,213 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:51,778 INFO L146 ILogger]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:51,779 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:51,779 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2019-05-23 10:07:51,779 INFO L146 ILogger]: Interpolant automaton has 134 states [2019-05-23 10:07:51,780 INFO L146 ILogger]: Constructing interpolant automaton starting with 134 interpolants. [2019-05-23 10:07:51,780 INFO L146 ILogger]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-05-23 10:07:51,780 INFO L146 ILogger]: Start difference. First operand 269 states and 269 transitions. Second operand 134 states. [2019-05-23 10:07:52,239 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:52,240 INFO L146 ILogger]: Finished difference Result 272 states and 272 transitions. [2019-05-23 10:07:52,240 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-05-23 10:07:52,240 INFO L146 ILogger]: Start accepts. Automaton has 134 states. Word has length 268 [2019-05-23 10:07:52,241 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:52,241 INFO L146 ILogger]: With dead ends: 272 [2019-05-23 10:07:52,241 INFO L146 ILogger]: Without dead ends: 272 [2019-05-23 10:07:52,242 INFO L146 ILogger]: 0 DeclaredPredicates, 267 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-05-23 10:07:52,242 INFO L146 ILogger]: Start minimizeSevpa. Operand 272 states. [2019-05-23 10:07:52,244 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-05-23 10:07:52,244 INFO L146 ILogger]: Start removeUnreachable. Operand 271 states. [2019-05-23 10:07:52,244 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-05-23 10:07:52,244 INFO L146 ILogger]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2019-05-23 10:07:52,245 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:52,245 INFO L146 ILogger]: Abstraction has 271 states and 271 transitions. [2019-05-23 10:07:52,245 INFO L146 ILogger]: Interpolant automaton has 134 states. [2019-05-23 10:07:52,245 INFO L146 ILogger]: Start isEmpty. Operand 271 states and 271 transitions. [2019-05-23 10:07:52,246 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 271 [2019-05-23 10:07:52,246 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:52,246 INFO L146 ILogger]: trace histogram [132, 132, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:52,246 INFO L146 ILogger]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:52,246 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:52,246 INFO L146 ILogger]: Analyzing trace with hash 876560637, now seen corresponding path program 132 times [2019-05-23 10:07:52,247 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:52,262 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:52,264 INFO L146 ILogger]: Trace formula consists of 426 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 10:07:52,265 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:07:57,927 INFO L146 ILogger]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:07:57,928 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:07:57,928 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2019-05-23 10:07:57,928 INFO L146 ILogger]: Interpolant automaton has 135 states [2019-05-23 10:07:57,929 INFO L146 ILogger]: Constructing interpolant automaton starting with 135 interpolants. [2019-05-23 10:07:57,929 INFO L146 ILogger]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 10:07:57,929 INFO L146 ILogger]: Start difference. First operand 271 states and 271 transitions. Second operand 135 states. [2019-05-23 10:07:58,355 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:07:58,356 INFO L146 ILogger]: Finished difference Result 274 states and 274 transitions. [2019-05-23 10:07:58,356 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-05-23 10:07:58,356 INFO L146 ILogger]: Start accepts. Automaton has 135 states. Word has length 270 [2019-05-23 10:07:58,356 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:07:58,357 INFO L146 ILogger]: With dead ends: 274 [2019-05-23 10:07:58,357 INFO L146 ILogger]: Without dead ends: 274 [2019-05-23 10:07:58,358 INFO L146 ILogger]: 0 DeclaredPredicates, 269 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 10:07:58,358 INFO L146 ILogger]: Start minimizeSevpa. Operand 274 states. [2019-05-23 10:07:58,360 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-05-23 10:07:58,360 INFO L146 ILogger]: Start removeUnreachable. Operand 273 states. [2019-05-23 10:07:58,360 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-05-23 10:07:58,361 INFO L146 ILogger]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2019-05-23 10:07:58,361 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:07:58,361 INFO L146 ILogger]: Abstraction has 273 states and 273 transitions. [2019-05-23 10:07:58,361 INFO L146 ILogger]: Interpolant automaton has 135 states. [2019-05-23 10:07:58,361 INFO L146 ILogger]: Start isEmpty. Operand 273 states and 273 transitions. [2019-05-23 10:07:58,362 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 273 [2019-05-23 10:07:58,362 INFO L146 ILogger]: Found error trace [2019-05-23 10:07:58,362 INFO L146 ILogger]: trace histogram [133, 133, 1, 1, 1, 1, 1, 1] [2019-05-23 10:07:58,362 INFO L146 ILogger]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:07:58,363 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:07:58,363 INFO L146 ILogger]: Analyzing trace with hash -357782117, now seen corresponding path program 133 times [2019-05-23 10:07:58,363 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:07:58,383 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:07:58,387 INFO L146 ILogger]: Trace formula consists of 429 conjuncts, 135 conjunts are in the unsatisfiable core [2019-05-23 10:07:58,389 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:04,244 INFO L146 ILogger]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:04,244 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:04,244 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2019-05-23 10:08:04,245 INFO L146 ILogger]: Interpolant automaton has 136 states [2019-05-23 10:08:04,245 INFO L146 ILogger]: Constructing interpolant automaton starting with 136 interpolants. [2019-05-23 10:08:04,246 INFO L146 ILogger]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 10:08:04,246 INFO L146 ILogger]: Start difference. First operand 273 states and 273 transitions. Second operand 136 states. [2019-05-23 10:08:04,663 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:04,663 INFO L146 ILogger]: Finished difference Result 276 states and 276 transitions. [2019-05-23 10:08:04,664 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-05-23 10:08:04,664 INFO L146 ILogger]: Start accepts. Automaton has 136 states. Word has length 272 [2019-05-23 10:08:04,664 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:04,665 INFO L146 ILogger]: With dead ends: 276 [2019-05-23 10:08:04,665 INFO L146 ILogger]: Without dead ends: 276 [2019-05-23 10:08:04,665 INFO L146 ILogger]: 0 DeclaredPredicates, 271 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 10:08:04,666 INFO L146 ILogger]: Start minimizeSevpa. Operand 276 states. [2019-05-23 10:08:04,667 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 276 to 275. [2019-05-23 10:08:04,668 INFO L146 ILogger]: Start removeUnreachable. Operand 275 states. [2019-05-23 10:08:04,668 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-05-23 10:08:04,668 INFO L146 ILogger]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2019-05-23 10:08:04,668 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:04,669 INFO L146 ILogger]: Abstraction has 275 states and 275 transitions. [2019-05-23 10:08:04,669 INFO L146 ILogger]: Interpolant automaton has 136 states. [2019-05-23 10:08:04,669 INFO L146 ILogger]: Start isEmpty. Operand 275 states and 275 transitions. [2019-05-23 10:08:04,669 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 275 [2019-05-23 10:08:04,670 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:04,670 INFO L146 ILogger]: trace histogram [134, 134, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:04,670 INFO L146 ILogger]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:04,670 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:04,670 INFO L146 ILogger]: Analyzing trace with hash -1150195015, now seen corresponding path program 134 times [2019-05-23 10:08:04,670 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:04,685 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:04,687 INFO L146 ILogger]: Trace formula consists of 432 conjuncts, 136 conjunts are in the unsatisfiable core [2019-05-23 10:08:04,689 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:10,583 INFO L146 ILogger]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:10,583 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:10,583 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2019-05-23 10:08:10,584 INFO L146 ILogger]: Interpolant automaton has 137 states [2019-05-23 10:08:10,584 INFO L146 ILogger]: Constructing interpolant automaton starting with 137 interpolants. [2019-05-23 10:08:10,585 INFO L146 ILogger]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 10:08:10,585 INFO L146 ILogger]: Start difference. First operand 275 states and 275 transitions. Second operand 137 states. [2019-05-23 10:08:10,997 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:10,997 INFO L146 ILogger]: Finished difference Result 278 states and 278 transitions. [2019-05-23 10:08:10,998 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-05-23 10:08:10,998 INFO L146 ILogger]: Start accepts. Automaton has 137 states. Word has length 274 [2019-05-23 10:08:10,998 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:10,999 INFO L146 ILogger]: With dead ends: 278 [2019-05-23 10:08:10,999 INFO L146 ILogger]: Without dead ends: 278 [2019-05-23 10:08:11,000 INFO L146 ILogger]: 0 DeclaredPredicates, 273 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 10:08:11,000 INFO L146 ILogger]: Start minimizeSevpa. Operand 278 states. [2019-05-23 10:08:11,002 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-05-23 10:08:11,002 INFO L146 ILogger]: Start removeUnreachable. Operand 277 states. [2019-05-23 10:08:11,002 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-05-23 10:08:11,002 INFO L146 ILogger]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2019-05-23 10:08:11,003 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:11,003 INFO L146 ILogger]: Abstraction has 277 states and 277 transitions. [2019-05-23 10:08:11,003 INFO L146 ILogger]: Interpolant automaton has 137 states. [2019-05-23 10:08:11,003 INFO L146 ILogger]: Start isEmpty. Operand 277 states and 277 transitions. [2019-05-23 10:08:11,004 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 277 [2019-05-23 10:08:11,004 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:11,004 INFO L146 ILogger]: trace histogram [135, 135, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:11,004 INFO L146 ILogger]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:11,004 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:11,004 INFO L146 ILogger]: Analyzing trace with hash 1845188695, now seen corresponding path program 135 times [2019-05-23 10:08:11,005 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:11,020 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:11,022 INFO L146 ILogger]: Trace formula consists of 435 conjuncts, 137 conjunts are in the unsatisfiable core [2019-05-23 10:08:11,024 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:16,940 INFO L146 ILogger]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:16,940 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:16,940 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2019-05-23 10:08:16,940 INFO L146 ILogger]: Interpolant automaton has 138 states [2019-05-23 10:08:16,941 INFO L146 ILogger]: Constructing interpolant automaton starting with 138 interpolants. [2019-05-23 10:08:16,941 INFO L146 ILogger]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-05-23 10:08:16,942 INFO L146 ILogger]: Start difference. First operand 277 states and 277 transitions. Second operand 138 states. [2019-05-23 10:08:17,410 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:17,410 INFO L146 ILogger]: Finished difference Result 280 states and 280 transitions. [2019-05-23 10:08:17,410 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-05-23 10:08:17,411 INFO L146 ILogger]: Start accepts. Automaton has 138 states. Word has length 276 [2019-05-23 10:08:17,411 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:17,412 INFO L146 ILogger]: With dead ends: 280 [2019-05-23 10:08:17,412 INFO L146 ILogger]: Without dead ends: 280 [2019-05-23 10:08:17,413 INFO L146 ILogger]: 0 DeclaredPredicates, 275 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-05-23 10:08:17,413 INFO L146 ILogger]: Start minimizeSevpa. Operand 280 states. [2019-05-23 10:08:17,415 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 280 to 279. [2019-05-23 10:08:17,415 INFO L146 ILogger]: Start removeUnreachable. Operand 279 states. [2019-05-23 10:08:17,415 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2019-05-23 10:08:17,415 INFO L146 ILogger]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2019-05-23 10:08:17,416 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:17,416 INFO L146 ILogger]: Abstraction has 279 states and 279 transitions. [2019-05-23 10:08:17,416 INFO L146 ILogger]: Interpolant automaton has 138 states. [2019-05-23 10:08:17,416 INFO L146 ILogger]: Start isEmpty. Operand 279 states and 279 transitions. [2019-05-23 10:08:17,417 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 279 [2019-05-23 10:08:17,417 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:17,417 INFO L146 ILogger]: trace histogram [136, 136, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:17,417 INFO L146 ILogger]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:17,417 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:17,417 INFO L146 ILogger]: Analyzing trace with hash -1514121611, now seen corresponding path program 136 times [2019-05-23 10:08:17,418 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:17,432 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:17,435 INFO L146 ILogger]: Trace formula consists of 438 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 10:08:17,436 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:23,467 INFO L146 ILogger]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:23,468 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:23,468 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2019-05-23 10:08:23,468 INFO L146 ILogger]: Interpolant automaton has 139 states [2019-05-23 10:08:23,469 INFO L146 ILogger]: Constructing interpolant automaton starting with 139 interpolants. [2019-05-23 10:08:23,469 INFO L146 ILogger]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 10:08:23,470 INFO L146 ILogger]: Start difference. First operand 279 states and 279 transitions. Second operand 139 states. [2019-05-23 10:08:23,947 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:23,947 INFO L146 ILogger]: Finished difference Result 282 states and 282 transitions. [2019-05-23 10:08:23,948 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-05-23 10:08:23,948 INFO L146 ILogger]: Start accepts. Automaton has 139 states. Word has length 278 [2019-05-23 10:08:23,948 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:23,949 INFO L146 ILogger]: With dead ends: 282 [2019-05-23 10:08:23,949 INFO L146 ILogger]: Without dead ends: 282 [2019-05-23 10:08:23,950 INFO L146 ILogger]: 0 DeclaredPredicates, 277 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 10:08:23,950 INFO L146 ILogger]: Start minimizeSevpa. Operand 282 states. [2019-05-23 10:08:23,952 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-05-23 10:08:23,952 INFO L146 ILogger]: Start removeUnreachable. Operand 281 states. [2019-05-23 10:08:23,952 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-05-23 10:08:23,952 INFO L146 ILogger]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2019-05-23 10:08:23,953 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:23,953 INFO L146 ILogger]: Abstraction has 281 states and 281 transitions. [2019-05-23 10:08:23,953 INFO L146 ILogger]: Interpolant automaton has 139 states. [2019-05-23 10:08:23,953 INFO L146 ILogger]: Start isEmpty. Operand 281 states and 281 transitions. [2019-05-23 10:08:23,953 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 281 [2019-05-23 10:08:23,954 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:23,954 INFO L146 ILogger]: trace histogram [137, 137, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:23,954 INFO L146 ILogger]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:23,954 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:23,954 INFO L146 ILogger]: Analyzing trace with hash 4080915, now seen corresponding path program 137 times [2019-05-23 10:08:23,954 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:23,970 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:23,974 INFO L146 ILogger]: Trace formula consists of 441 conjuncts, 139 conjunts are in the unsatisfiable core [2019-05-23 10:08:23,976 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:30,123 INFO L146 ILogger]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:30,123 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:30,124 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-05-23 10:08:30,124 INFO L146 ILogger]: Interpolant automaton has 140 states [2019-05-23 10:08:30,125 INFO L146 ILogger]: Constructing interpolant automaton starting with 140 interpolants. [2019-05-23 10:08:30,125 INFO L146 ILogger]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 10:08:30,125 INFO L146 ILogger]: Start difference. First operand 281 states and 281 transitions. Second operand 140 states. [2019-05-23 10:08:30,610 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:30,610 INFO L146 ILogger]: Finished difference Result 284 states and 284 transitions. [2019-05-23 10:08:30,610 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-05-23 10:08:30,611 INFO L146 ILogger]: Start accepts. Automaton has 140 states. Word has length 280 [2019-05-23 10:08:30,611 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:30,611 INFO L146 ILogger]: With dead ends: 284 [2019-05-23 10:08:30,612 INFO L146 ILogger]: Without dead ends: 284 [2019-05-23 10:08:30,612 INFO L146 ILogger]: 0 DeclaredPredicates, 279 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 10:08:30,613 INFO L146 ILogger]: Start minimizeSevpa. Operand 284 states. [2019-05-23 10:08:30,614 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-05-23 10:08:30,615 INFO L146 ILogger]: Start removeUnreachable. Operand 283 states. [2019-05-23 10:08:30,615 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-05-23 10:08:30,615 INFO L146 ILogger]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2019-05-23 10:08:30,615 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:30,616 INFO L146 ILogger]: Abstraction has 283 states and 283 transitions. [2019-05-23 10:08:30,616 INFO L146 ILogger]: Interpolant automaton has 140 states. [2019-05-23 10:08:30,616 INFO L146 ILogger]: Start isEmpty. Operand 283 states and 283 transitions. [2019-05-23 10:08:30,617 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 283 [2019-05-23 10:08:30,617 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:30,617 INFO L146 ILogger]: trace histogram [138, 138, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:30,617 INFO L146 ILogger]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:30,617 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:30,617 INFO L146 ILogger]: Analyzing trace with hash -1292172239, now seen corresponding path program 138 times [2019-05-23 10:08:30,618 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:30,639 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:30,643 INFO L146 ILogger]: Trace formula consists of 444 conjuncts, 140 conjunts are in the unsatisfiable core [2019-05-23 10:08:30,645 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:36,919 INFO L146 ILogger]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:36,920 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:36,920 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2019-05-23 10:08:36,920 INFO L146 ILogger]: Interpolant automaton has 141 states [2019-05-23 10:08:36,921 INFO L146 ILogger]: Constructing interpolant automaton starting with 141 interpolants. [2019-05-23 10:08:36,921 INFO L146 ILogger]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 10:08:36,921 INFO L146 ILogger]: Start difference. First operand 283 states and 283 transitions. Second operand 141 states. [2019-05-23 10:08:37,432 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:37,432 INFO L146 ILogger]: Finished difference Result 286 states and 286 transitions. [2019-05-23 10:08:37,433 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-05-23 10:08:37,433 INFO L146 ILogger]: Start accepts. Automaton has 141 states. Word has length 282 [2019-05-23 10:08:37,433 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:37,434 INFO L146 ILogger]: With dead ends: 286 [2019-05-23 10:08:37,434 INFO L146 ILogger]: Without dead ends: 286 [2019-05-23 10:08:37,435 INFO L146 ILogger]: 0 DeclaredPredicates, 281 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 10:08:37,435 INFO L146 ILogger]: Start minimizeSevpa. Operand 286 states. [2019-05-23 10:08:37,437 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-05-23 10:08:37,437 INFO L146 ILogger]: Start removeUnreachable. Operand 285 states. [2019-05-23 10:08:37,437 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-05-23 10:08:37,438 INFO L146 ILogger]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2019-05-23 10:08:37,438 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:37,438 INFO L146 ILogger]: Abstraction has 285 states and 285 transitions. [2019-05-23 10:08:37,438 INFO L146 ILogger]: Interpolant automaton has 141 states. [2019-05-23 10:08:37,438 INFO L146 ILogger]: Start isEmpty. Operand 285 states and 285 transitions. [2019-05-23 10:08:37,439 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 285 [2019-05-23 10:08:37,439 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:37,439 INFO L146 ILogger]: trace histogram [139, 139, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:37,439 INFO L146 ILogger]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:37,439 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:37,439 INFO L146 ILogger]: Analyzing trace with hash -1450937393, now seen corresponding path program 139 times [2019-05-23 10:08:37,440 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:37,455 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:37,459 INFO L146 ILogger]: Trace formula consists of 447 conjuncts, 141 conjunts are in the unsatisfiable core [2019-05-23 10:08:37,460 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:43,740 INFO L146 ILogger]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:43,741 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:43,741 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2019-05-23 10:08:43,741 INFO L146 ILogger]: Interpolant automaton has 142 states [2019-05-23 10:08:43,742 INFO L146 ILogger]: Constructing interpolant automaton starting with 142 interpolants. [2019-05-23 10:08:43,742 INFO L146 ILogger]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-05-23 10:08:43,743 INFO L146 ILogger]: Start difference. First operand 285 states and 285 transitions. Second operand 142 states. [2019-05-23 10:08:44,191 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:44,192 INFO L146 ILogger]: Finished difference Result 288 states and 288 transitions. [2019-05-23 10:08:44,192 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-05-23 10:08:44,192 INFO L146 ILogger]: Start accepts. Automaton has 142 states. Word has length 284 [2019-05-23 10:08:44,192 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:44,193 INFO L146 ILogger]: With dead ends: 288 [2019-05-23 10:08:44,193 INFO L146 ILogger]: Without dead ends: 288 [2019-05-23 10:08:44,194 INFO L146 ILogger]: 0 DeclaredPredicates, 283 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-05-23 10:08:44,194 INFO L146 ILogger]: Start minimizeSevpa. Operand 288 states. [2019-05-23 10:08:44,196 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 288 to 287. [2019-05-23 10:08:44,196 INFO L146 ILogger]: Start removeUnreachable. Operand 287 states. [2019-05-23 10:08:44,196 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-05-23 10:08:44,197 INFO L146 ILogger]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2019-05-23 10:08:44,197 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:44,197 INFO L146 ILogger]: Abstraction has 287 states and 287 transitions. [2019-05-23 10:08:44,197 INFO L146 ILogger]: Interpolant automaton has 142 states. [2019-05-23 10:08:44,197 INFO L146 ILogger]: Start isEmpty. Operand 287 states and 287 transitions. [2019-05-23 10:08:44,198 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 287 [2019-05-23 10:08:44,198 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:44,198 INFO L146 ILogger]: trace histogram [140, 140, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:44,198 INFO L146 ILogger]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:44,198 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:44,198 INFO L146 ILogger]: Analyzing trace with hash 594572269, now seen corresponding path program 140 times [2019-05-23 10:08:44,199 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:44,216 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:44,219 INFO L146 ILogger]: Trace formula consists of 450 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 10:08:44,220 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:50,563 INFO L146 ILogger]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:50,563 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:50,563 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2019-05-23 10:08:50,564 INFO L146 ILogger]: Interpolant automaton has 143 states [2019-05-23 10:08:50,565 INFO L146 ILogger]: Constructing interpolant automaton starting with 143 interpolants. [2019-05-23 10:08:50,565 INFO L146 ILogger]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 10:08:50,565 INFO L146 ILogger]: Start difference. First operand 287 states and 287 transitions. Second operand 143 states. [2019-05-23 10:08:51,036 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:51,036 INFO L146 ILogger]: Finished difference Result 290 states and 290 transitions. [2019-05-23 10:08:51,037 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-05-23 10:08:51,037 INFO L146 ILogger]: Start accepts. Automaton has 143 states. Word has length 286 [2019-05-23 10:08:51,037 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:51,038 INFO L146 ILogger]: With dead ends: 290 [2019-05-23 10:08:51,038 INFO L146 ILogger]: Without dead ends: 290 [2019-05-23 10:08:51,039 INFO L146 ILogger]: 0 DeclaredPredicates, 285 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 10:08:51,040 INFO L146 ILogger]: Start minimizeSevpa. Operand 290 states. [2019-05-23 10:08:51,042 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-05-23 10:08:51,042 INFO L146 ILogger]: Start removeUnreachable. Operand 289 states. [2019-05-23 10:08:51,042 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-05-23 10:08:51,042 INFO L146 ILogger]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2019-05-23 10:08:51,043 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:51,043 INFO L146 ILogger]: Abstraction has 289 states and 289 transitions. [2019-05-23 10:08:51,043 INFO L146 ILogger]: Interpolant automaton has 143 states. [2019-05-23 10:08:51,043 INFO L146 ILogger]: Start isEmpty. Operand 289 states and 289 transitions. [2019-05-23 10:08:51,044 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 289 [2019-05-23 10:08:51,044 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:51,044 INFO L146 ILogger]: trace histogram [141, 141, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:51,044 INFO L146 ILogger]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:51,044 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:51,045 INFO L146 ILogger]: Analyzing trace with hash -765664117, now seen corresponding path program 141 times [2019-05-23 10:08:51,045 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:51,072 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:51,076 INFO L146 ILogger]: Trace formula consists of 453 conjuncts, 143 conjunts are in the unsatisfiable core [2019-05-23 10:08:51,078 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:08:57,664 INFO L146 ILogger]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:08:57,664 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:08:57,664 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2019-05-23 10:08:57,664 INFO L146 ILogger]: Interpolant automaton has 144 states [2019-05-23 10:08:57,665 INFO L146 ILogger]: Constructing interpolant automaton starting with 144 interpolants. [2019-05-23 10:08:57,665 INFO L146 ILogger]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-05-23 10:08:57,666 INFO L146 ILogger]: Start difference. First operand 289 states and 289 transitions. Second operand 144 states. [2019-05-23 10:08:58,131 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:08:58,131 INFO L146 ILogger]: Finished difference Result 292 states and 292 transitions. [2019-05-23 10:08:58,131 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-05-23 10:08:58,131 INFO L146 ILogger]: Start accepts. Automaton has 144 states. Word has length 288 [2019-05-23 10:08:58,132 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:08:58,132 INFO L146 ILogger]: With dead ends: 292 [2019-05-23 10:08:58,132 INFO L146 ILogger]: Without dead ends: 292 [2019-05-23 10:08:58,133 INFO L146 ILogger]: 0 DeclaredPredicates, 287 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-05-23 10:08:58,133 INFO L146 ILogger]: Start minimizeSevpa. Operand 292 states. [2019-05-23 10:08:58,135 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-05-23 10:08:58,135 INFO L146 ILogger]: Start removeUnreachable. Operand 291 states. [2019-05-23 10:08:58,136 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-05-23 10:08:58,136 INFO L146 ILogger]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2019-05-23 10:08:58,136 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:08:58,136 INFO L146 ILogger]: Abstraction has 291 states and 291 transitions. [2019-05-23 10:08:58,136 INFO L146 ILogger]: Interpolant automaton has 144 states. [2019-05-23 10:08:58,136 INFO L146 ILogger]: Start isEmpty. Operand 291 states and 291 transitions. [2019-05-23 10:08:58,137 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 291 [2019-05-23 10:08:58,137 INFO L146 ILogger]: Found error trace [2019-05-23 10:08:58,137 INFO L146 ILogger]: trace histogram [142, 142, 1, 1, 1, 1, 1, 1] [2019-05-23 10:08:58,137 INFO L146 ILogger]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:08:58,138 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:08:58,138 INFO L146 ILogger]: Analyzing trace with hash 2012194217, now seen corresponding path program 142 times [2019-05-23 10:08:58,138 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:08:58,155 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:08:58,157 INFO L146 ILogger]: Trace formula consists of 456 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 10:08:58,159 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:04,685 INFO L146 ILogger]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:04,686 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:04,686 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2019-05-23 10:09:04,686 INFO L146 ILogger]: Interpolant automaton has 145 states [2019-05-23 10:09:04,687 INFO L146 ILogger]: Constructing interpolant automaton starting with 145 interpolants. [2019-05-23 10:09:04,688 INFO L146 ILogger]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 10:09:04,688 INFO L146 ILogger]: Start difference. First operand 291 states and 291 transitions. Second operand 145 states. [2019-05-23 10:09:05,190 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:05,190 INFO L146 ILogger]: Finished difference Result 294 states and 294 transitions. [2019-05-23 10:09:05,190 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-05-23 10:09:05,191 INFO L146 ILogger]: Start accepts. Automaton has 145 states. Word has length 290 [2019-05-23 10:09:05,191 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:05,191 INFO L146 ILogger]: With dead ends: 294 [2019-05-23 10:09:05,192 INFO L146 ILogger]: Without dead ends: 294 [2019-05-23 10:09:05,193 INFO L146 ILogger]: 0 DeclaredPredicates, 289 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 10:09:05,193 INFO L146 ILogger]: Start minimizeSevpa. Operand 294 states. [2019-05-23 10:09:05,195 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-05-23 10:09:05,195 INFO L146 ILogger]: Start removeUnreachable. Operand 293 states. [2019-05-23 10:09:05,195 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-05-23 10:09:05,195 INFO L146 ILogger]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2019-05-23 10:09:05,195 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:05,195 INFO L146 ILogger]: Abstraction has 293 states and 293 transitions. [2019-05-23 10:09:05,195 INFO L146 ILogger]: Interpolant automaton has 145 states. [2019-05-23 10:09:05,196 INFO L146 ILogger]: Start isEmpty. Operand 293 states and 293 transitions. [2019-05-23 10:09:05,196 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 293 [2019-05-23 10:09:05,196 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:05,196 INFO L146 ILogger]: trace histogram [143, 143, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:05,196 INFO L146 ILogger]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:05,197 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:05,197 INFO L146 ILogger]: Analyzing trace with hash 64395079, now seen corresponding path program 143 times [2019-05-23 10:09:05,197 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:05,220 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:05,225 INFO L146 ILogger]: Trace formula consists of 459 conjuncts, 145 conjunts are in the unsatisfiable core [2019-05-23 10:09:05,227 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:11,920 INFO L146 ILogger]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:11,920 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:11,921 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2019-05-23 10:09:11,921 INFO L146 ILogger]: Interpolant automaton has 146 states [2019-05-23 10:09:11,922 INFO L146 ILogger]: Constructing interpolant automaton starting with 146 interpolants. [2019-05-23 10:09:11,922 INFO L146 ILogger]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-05-23 10:09:11,922 INFO L146 ILogger]: Start difference. First operand 293 states and 293 transitions. Second operand 146 states. [2019-05-23 10:09:12,449 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:12,450 INFO L146 ILogger]: Finished difference Result 296 states and 296 transitions. [2019-05-23 10:09:12,450 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-05-23 10:09:12,450 INFO L146 ILogger]: Start accepts. Automaton has 146 states. Word has length 292 [2019-05-23 10:09:12,450 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:12,451 INFO L146 ILogger]: With dead ends: 296 [2019-05-23 10:09:12,451 INFO L146 ILogger]: Without dead ends: 296 [2019-05-23 10:09:12,452 INFO L146 ILogger]: 0 DeclaredPredicates, 291 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-05-23 10:09:12,452 INFO L146 ILogger]: Start minimizeSevpa. Operand 296 states. [2019-05-23 10:09:12,454 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-05-23 10:09:12,454 INFO L146 ILogger]: Start removeUnreachable. Operand 295 states. [2019-05-23 10:09:12,454 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-05-23 10:09:12,454 INFO L146 ILogger]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2019-05-23 10:09:12,455 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:12,455 INFO L146 ILogger]: Abstraction has 295 states and 295 transitions. [2019-05-23 10:09:12,455 INFO L146 ILogger]: Interpolant automaton has 146 states. [2019-05-23 10:09:12,455 INFO L146 ILogger]: Start isEmpty. Operand 295 states and 295 transitions. [2019-05-23 10:09:12,456 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 295 [2019-05-23 10:09:12,456 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:12,456 INFO L146 ILogger]: trace histogram [144, 144, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:12,456 INFO L146 ILogger]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:12,456 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:12,456 INFO L146 ILogger]: Analyzing trace with hash 835164517, now seen corresponding path program 144 times [2019-05-23 10:09:12,457 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:12,473 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:12,475 INFO L146 ILogger]: Trace formula consists of 462 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 10:09:12,477 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:19,130 INFO L146 ILogger]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:19,131 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:19,131 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2019-05-23 10:09:19,131 INFO L146 ILogger]: Interpolant automaton has 147 states [2019-05-23 10:09:19,132 INFO L146 ILogger]: Constructing interpolant automaton starting with 147 interpolants. [2019-05-23 10:09:19,132 INFO L146 ILogger]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 10:09:19,132 INFO L146 ILogger]: Start difference. First operand 295 states and 295 transitions. Second operand 147 states. [2019-05-23 10:09:19,614 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:19,614 INFO L146 ILogger]: Finished difference Result 298 states and 298 transitions. [2019-05-23 10:09:19,614 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-05-23 10:09:19,614 INFO L146 ILogger]: Start accepts. Automaton has 147 states. Word has length 294 [2019-05-23 10:09:19,615 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:19,615 INFO L146 ILogger]: With dead ends: 298 [2019-05-23 10:09:19,615 INFO L146 ILogger]: Without dead ends: 298 [2019-05-23 10:09:19,616 INFO L146 ILogger]: 0 DeclaredPredicates, 293 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 10:09:19,617 INFO L146 ILogger]: Start minimizeSevpa. Operand 298 states. [2019-05-23 10:09:19,618 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-05-23 10:09:19,619 INFO L146 ILogger]: Start removeUnreachable. Operand 297 states. [2019-05-23 10:09:19,619 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-05-23 10:09:19,619 INFO L146 ILogger]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2019-05-23 10:09:19,619 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:19,619 INFO L146 ILogger]: Abstraction has 297 states and 297 transitions. [2019-05-23 10:09:19,619 INFO L146 ILogger]: Interpolant automaton has 147 states. [2019-05-23 10:09:19,619 INFO L146 ILogger]: Start isEmpty. Operand 297 states and 297 transitions. [2019-05-23 10:09:19,620 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 297 [2019-05-23 10:09:19,620 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:19,620 INFO L146 ILogger]: trace histogram [145, 145, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:19,620 INFO L146 ILogger]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:19,621 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:19,621 INFO L146 ILogger]: Analyzing trace with hash -1484747773, now seen corresponding path program 145 times [2019-05-23 10:09:19,621 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:19,637 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:19,640 INFO L146 ILogger]: Trace formula consists of 465 conjuncts, 147 conjunts are in the unsatisfiable core [2019-05-23 10:09:19,642 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:26,471 INFO L146 ILogger]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:26,472 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:26,472 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-05-23 10:09:26,472 INFO L146 ILogger]: Interpolant automaton has 148 states [2019-05-23 10:09:26,473 INFO L146 ILogger]: Constructing interpolant automaton starting with 148 interpolants. [2019-05-23 10:09:26,474 INFO L146 ILogger]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 10:09:26,474 INFO L146 ILogger]: Start difference. First operand 297 states and 297 transitions. Second operand 148 states. [2019-05-23 10:09:26,988 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:26,988 INFO L146 ILogger]: Finished difference Result 300 states and 300 transitions. [2019-05-23 10:09:26,989 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-05-23 10:09:26,989 INFO L146 ILogger]: Start accepts. Automaton has 148 states. Word has length 296 [2019-05-23 10:09:26,989 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:26,990 INFO L146 ILogger]: With dead ends: 300 [2019-05-23 10:09:26,990 INFO L146 ILogger]: Without dead ends: 300 [2019-05-23 10:09:26,991 INFO L146 ILogger]: 0 DeclaredPredicates, 295 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 10:09:26,991 INFO L146 ILogger]: Start minimizeSevpa. Operand 300 states. [2019-05-23 10:09:26,993 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-05-23 10:09:26,993 INFO L146 ILogger]: Start removeUnreachable. Operand 299 states. [2019-05-23 10:09:26,993 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-05-23 10:09:26,993 INFO L146 ILogger]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2019-05-23 10:09:26,993 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:26,993 INFO L146 ILogger]: Abstraction has 299 states and 299 transitions. [2019-05-23 10:09:26,994 INFO L146 ILogger]: Interpolant automaton has 148 states. [2019-05-23 10:09:26,994 INFO L146 ILogger]: Start isEmpty. Operand 299 states and 299 transitions. [2019-05-23 10:09:26,994 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 299 [2019-05-23 10:09:26,994 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:26,994 INFO L146 ILogger]: trace histogram [146, 146, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:26,995 INFO L146 ILogger]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:26,995 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:26,995 INFO L146 ILogger]: Analyzing trace with hash -1832431839, now seen corresponding path program 146 times [2019-05-23 10:09:26,995 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:27,011 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:27,014 INFO L146 ILogger]: Trace formula consists of 468 conjuncts, 148 conjunts are in the unsatisfiable core [2019-05-23 10:09:27,015 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:33,975 INFO L146 ILogger]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:33,976 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:33,976 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2019-05-23 10:09:33,976 INFO L146 ILogger]: Interpolant automaton has 149 states [2019-05-23 10:09:33,977 INFO L146 ILogger]: Constructing interpolant automaton starting with 149 interpolants. [2019-05-23 10:09:33,977 INFO L146 ILogger]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 10:09:33,978 INFO L146 ILogger]: Start difference. First operand 299 states and 299 transitions. Second operand 149 states. [2019-05-23 10:09:34,523 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:34,524 INFO L146 ILogger]: Finished difference Result 302 states and 302 transitions. [2019-05-23 10:09:34,524 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-05-23 10:09:34,524 INFO L146 ILogger]: Start accepts. Automaton has 149 states. Word has length 298 [2019-05-23 10:09:34,525 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:34,525 INFO L146 ILogger]: With dead ends: 302 [2019-05-23 10:09:34,525 INFO L146 ILogger]: Without dead ends: 302 [2019-05-23 10:09:34,527 INFO L146 ILogger]: 0 DeclaredPredicates, 297 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 10:09:34,527 INFO L146 ILogger]: Start minimizeSevpa. Operand 302 states. [2019-05-23 10:09:34,528 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-05-23 10:09:34,529 INFO L146 ILogger]: Start removeUnreachable. Operand 301 states. [2019-05-23 10:09:34,529 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-05-23 10:09:34,529 INFO L146 ILogger]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2019-05-23 10:09:34,529 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:34,530 INFO L146 ILogger]: Abstraction has 301 states and 301 transitions. [2019-05-23 10:09:34,530 INFO L146 ILogger]: Interpolant automaton has 149 states. [2019-05-23 10:09:34,530 INFO L146 ILogger]: Start isEmpty. Operand 301 states and 301 transitions. [2019-05-23 10:09:34,531 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 301 [2019-05-23 10:09:34,531 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:34,531 INFO L146 ILogger]: trace histogram [147, 147, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:34,531 INFO L146 ILogger]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:34,531 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:34,532 INFO L146 ILogger]: Analyzing trace with hash -949370177, now seen corresponding path program 147 times [2019-05-23 10:09:34,532 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:34,561 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:34,566 INFO L146 ILogger]: Trace formula consists of 471 conjuncts, 149 conjunts are in the unsatisfiable core [2019-05-23 10:09:34,568 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:41,559 INFO L146 ILogger]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:41,560 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:41,560 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2019-05-23 10:09:41,560 INFO L146 ILogger]: Interpolant automaton has 150 states [2019-05-23 10:09:41,561 INFO L146 ILogger]: Constructing interpolant automaton starting with 150 interpolants. [2019-05-23 10:09:41,562 INFO L146 ILogger]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-05-23 10:09:41,562 INFO L146 ILogger]: Start difference. First operand 301 states and 301 transitions. Second operand 150 states. [2019-05-23 10:09:42,061 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:42,061 INFO L146 ILogger]: Finished difference Result 304 states and 304 transitions. [2019-05-23 10:09:42,062 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-05-23 10:09:42,062 INFO L146 ILogger]: Start accepts. Automaton has 150 states. Word has length 300 [2019-05-23 10:09:42,062 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:42,063 INFO L146 ILogger]: With dead ends: 304 [2019-05-23 10:09:42,063 INFO L146 ILogger]: Without dead ends: 304 [2019-05-23 10:09:42,064 INFO L146 ILogger]: 0 DeclaredPredicates, 299 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-05-23 10:09:42,064 INFO L146 ILogger]: Start minimizeSevpa. Operand 304 states. [2019-05-23 10:09:42,066 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 304 to 303. [2019-05-23 10:09:42,066 INFO L146 ILogger]: Start removeUnreachable. Operand 303 states. [2019-05-23 10:09:42,067 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-05-23 10:09:42,067 INFO L146 ILogger]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2019-05-23 10:09:42,067 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:42,067 INFO L146 ILogger]: Abstraction has 303 states and 303 transitions. [2019-05-23 10:09:42,067 INFO L146 ILogger]: Interpolant automaton has 150 states. [2019-05-23 10:09:42,067 INFO L146 ILogger]: Start isEmpty. Operand 303 states and 303 transitions. [2019-05-23 10:09:42,068 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 303 [2019-05-23 10:09:42,068 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:42,068 INFO L146 ILogger]: trace histogram [148, 148, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:42,068 INFO L146 ILogger]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:42,068 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:42,068 INFO L146 ILogger]: Analyzing trace with hash 1564329693, now seen corresponding path program 148 times [2019-05-23 10:09:42,069 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:42,086 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:42,088 INFO L146 ILogger]: Trace formula consists of 474 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 10:09:42,090 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:49,244 INFO L146 ILogger]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:49,245 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:49,245 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2019-05-23 10:09:49,245 INFO L146 ILogger]: Interpolant automaton has 151 states [2019-05-23 10:09:49,246 INFO L146 ILogger]: Constructing interpolant automaton starting with 151 interpolants. [2019-05-23 10:09:49,246 INFO L146 ILogger]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 10:09:49,246 INFO L146 ILogger]: Start difference. First operand 303 states and 303 transitions. Second operand 151 states. [2019-05-23 10:09:49,806 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:49,807 INFO L146 ILogger]: Finished difference Result 306 states and 306 transitions. [2019-05-23 10:09:49,807 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-05-23 10:09:49,807 INFO L146 ILogger]: Start accepts. Automaton has 151 states. Word has length 302 [2019-05-23 10:09:49,808 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:49,808 INFO L146 ILogger]: With dead ends: 306 [2019-05-23 10:09:49,808 INFO L146 ILogger]: Without dead ends: 306 [2019-05-23 10:09:49,809 INFO L146 ILogger]: 0 DeclaredPredicates, 301 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 10:09:49,809 INFO L146 ILogger]: Start minimizeSevpa. Operand 306 states. [2019-05-23 10:09:49,811 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-05-23 10:09:49,811 INFO L146 ILogger]: Start removeUnreachable. Operand 305 states. [2019-05-23 10:09:49,812 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-05-23 10:09:49,812 INFO L146 ILogger]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2019-05-23 10:09:49,812 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:49,812 INFO L146 ILogger]: Abstraction has 305 states and 305 transitions. [2019-05-23 10:09:49,812 INFO L146 ILogger]: Interpolant automaton has 151 states. [2019-05-23 10:09:49,812 INFO L146 ILogger]: Start isEmpty. Operand 305 states and 305 transitions. [2019-05-23 10:09:49,813 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 305 [2019-05-23 10:09:49,813 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:49,813 INFO L146 ILogger]: trace histogram [149, 149, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:49,813 INFO L146 ILogger]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:49,813 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:49,814 INFO L146 ILogger]: Analyzing trace with hash -836682885, now seen corresponding path program 149 times [2019-05-23 10:09:49,814 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:49,831 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:49,836 INFO L146 ILogger]: Trace formula consists of 477 conjuncts, 151 conjunts are in the unsatisfiable core [2019-05-23 10:09:49,838 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:09:57,101 INFO L146 ILogger]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:09:57,101 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:09:57,101 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2019-05-23 10:09:57,101 INFO L146 ILogger]: Interpolant automaton has 152 states [2019-05-23 10:09:57,102 INFO L146 ILogger]: Constructing interpolant automaton starting with 152 interpolants. [2019-05-23 10:09:57,103 INFO L146 ILogger]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 10:09:57,103 INFO L146 ILogger]: Start difference. First operand 305 states and 305 transitions. Second operand 152 states. [2019-05-23 10:09:57,627 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:09:57,627 INFO L146 ILogger]: Finished difference Result 308 states and 308 transitions. [2019-05-23 10:09:57,628 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-05-23 10:09:57,628 INFO L146 ILogger]: Start accepts. Automaton has 152 states. Word has length 304 [2019-05-23 10:09:57,628 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:09:57,629 INFO L146 ILogger]: With dead ends: 308 [2019-05-23 10:09:57,629 INFO L146 ILogger]: Without dead ends: 308 [2019-05-23 10:09:57,630 INFO L146 ILogger]: 0 DeclaredPredicates, 303 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 10:09:57,630 INFO L146 ILogger]: Start minimizeSevpa. Operand 308 states. [2019-05-23 10:09:57,632 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 308 to 307. [2019-05-23 10:09:57,632 INFO L146 ILogger]: Start removeUnreachable. Operand 307 states. [2019-05-23 10:09:57,633 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-05-23 10:09:57,633 INFO L146 ILogger]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2019-05-23 10:09:57,633 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:09:57,633 INFO L146 ILogger]: Abstraction has 307 states and 307 transitions. [2019-05-23 10:09:57,633 INFO L146 ILogger]: Interpolant automaton has 152 states. [2019-05-23 10:09:57,633 INFO L146 ILogger]: Start isEmpty. Operand 307 states and 307 transitions. [2019-05-23 10:09:57,634 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 307 [2019-05-23 10:09:57,634 INFO L146 ILogger]: Found error trace [2019-05-23 10:09:57,634 INFO L146 ILogger]: trace histogram [150, 150, 1, 1, 1, 1, 1, 1] [2019-05-23 10:09:57,634 INFO L146 ILogger]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:09:57,634 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:09:57,634 INFO L146 ILogger]: Analyzing trace with hash -1812332391, now seen corresponding path program 150 times [2019-05-23 10:09:57,635 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:09:57,651 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:09:57,654 INFO L146 ILogger]: Trace formula consists of 480 conjuncts, 152 conjunts are in the unsatisfiable core [2019-05-23 10:09:57,656 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:04,907 INFO L146 ILogger]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:04,907 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:04,907 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2019-05-23 10:10:04,907 INFO L146 ILogger]: Interpolant automaton has 153 states [2019-05-23 10:10:04,909 INFO L146 ILogger]: Constructing interpolant automaton starting with 153 interpolants. [2019-05-23 10:10:04,909 INFO L146 ILogger]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 10:10:04,909 INFO L146 ILogger]: Start difference. First operand 307 states and 307 transitions. Second operand 153 states. [2019-05-23 10:10:05,446 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:05,446 INFO L146 ILogger]: Finished difference Result 310 states and 310 transitions. [2019-05-23 10:10:05,446 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-05-23 10:10:05,447 INFO L146 ILogger]: Start accepts. Automaton has 153 states. Word has length 306 [2019-05-23 10:10:05,447 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:05,447 INFO L146 ILogger]: With dead ends: 310 [2019-05-23 10:10:05,447 INFO L146 ILogger]: Without dead ends: 310 [2019-05-23 10:10:05,448 INFO L146 ILogger]: 0 DeclaredPredicates, 305 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 10:10:05,449 INFO L146 ILogger]: Start minimizeSevpa. Operand 310 states. [2019-05-23 10:10:05,450 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-05-23 10:10:05,451 INFO L146 ILogger]: Start removeUnreachable. Operand 309 states. [2019-05-23 10:10:05,451 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-05-23 10:10:05,451 INFO L146 ILogger]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2019-05-23 10:10:05,451 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:05,452 INFO L146 ILogger]: Abstraction has 309 states and 309 transitions. [2019-05-23 10:10:05,452 INFO L146 ILogger]: Interpolant automaton has 153 states. [2019-05-23 10:10:05,452 INFO L146 ILogger]: Start isEmpty. Operand 309 states and 309 transitions. [2019-05-23 10:10:05,452 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 309 [2019-05-23 10:10:05,452 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:05,453 INFO L146 ILogger]: trace histogram [151, 151, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:05,453 INFO L146 ILogger]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:05,453 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:05,453 INFO L146 ILogger]: Analyzing trace with hash 1186330167, now seen corresponding path program 151 times [2019-05-23 10:10:05,453 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:05,471 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:05,475 INFO L146 ILogger]: Trace formula consists of 483 conjuncts, 153 conjunts are in the unsatisfiable core [2019-05-23 10:10:05,477 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:12,895 INFO L146 ILogger]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:12,895 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:12,895 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2019-05-23 10:10:12,895 INFO L146 ILogger]: Interpolant automaton has 154 states [2019-05-23 10:10:12,896 INFO L146 ILogger]: Constructing interpolant automaton starting with 154 interpolants. [2019-05-23 10:10:12,897 INFO L146 ILogger]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-05-23 10:10:12,897 INFO L146 ILogger]: Start difference. First operand 309 states and 309 transitions. Second operand 154 states. [2019-05-23 10:10:13,433 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:13,433 INFO L146 ILogger]: Finished difference Result 312 states and 312 transitions. [2019-05-23 10:10:13,433 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-05-23 10:10:13,434 INFO L146 ILogger]: Start accepts. Automaton has 154 states. Word has length 308 [2019-05-23 10:10:13,434 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:13,435 INFO L146 ILogger]: With dead ends: 312 [2019-05-23 10:10:13,435 INFO L146 ILogger]: Without dead ends: 312 [2019-05-23 10:10:13,436 INFO L146 ILogger]: 0 DeclaredPredicates, 307 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-05-23 10:10:13,436 INFO L146 ILogger]: Start minimizeSevpa. Operand 312 states. [2019-05-23 10:10:13,438 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 312 to 311. [2019-05-23 10:10:13,438 INFO L146 ILogger]: Start removeUnreachable. Operand 311 states. [2019-05-23 10:10:13,439 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-05-23 10:10:13,439 INFO L146 ILogger]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2019-05-23 10:10:13,439 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:13,439 INFO L146 ILogger]: Abstraction has 311 states and 311 transitions. [2019-05-23 10:10:13,440 INFO L146 ILogger]: Interpolant automaton has 154 states. [2019-05-23 10:10:13,440 INFO L146 ILogger]: Start isEmpty. Operand 311 states and 311 transitions. [2019-05-23 10:10:13,441 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 311 [2019-05-23 10:10:13,441 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:13,441 INFO L146 ILogger]: trace histogram [152, 152, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:13,441 INFO L146 ILogger]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:13,441 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:13,441 INFO L146 ILogger]: Analyzing trace with hash 977992789, now seen corresponding path program 152 times [2019-05-23 10:10:13,442 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:13,474 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:13,479 INFO L146 ILogger]: Trace formula consists of 486 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 10:10:13,483 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:21,064 INFO L146 ILogger]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:21,065 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:21,065 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2019-05-23 10:10:21,065 INFO L146 ILogger]: Interpolant automaton has 155 states [2019-05-23 10:10:21,066 INFO L146 ILogger]: Constructing interpolant automaton starting with 155 interpolants. [2019-05-23 10:10:21,066 INFO L146 ILogger]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 10:10:21,067 INFO L146 ILogger]: Start difference. First operand 311 states and 311 transitions. Second operand 155 states. [2019-05-23 10:10:21,602 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:21,602 INFO L146 ILogger]: Finished difference Result 314 states and 314 transitions. [2019-05-23 10:10:21,602 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-05-23 10:10:21,603 INFO L146 ILogger]: Start accepts. Automaton has 155 states. Word has length 310 [2019-05-23 10:10:21,603 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:21,603 INFO L146 ILogger]: With dead ends: 314 [2019-05-23 10:10:21,604 INFO L146 ILogger]: Without dead ends: 314 [2019-05-23 10:10:21,605 INFO L146 ILogger]: 0 DeclaredPredicates, 309 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 10:10:21,605 INFO L146 ILogger]: Start minimizeSevpa. Operand 314 states. [2019-05-23 10:10:21,607 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-05-23 10:10:21,607 INFO L146 ILogger]: Start removeUnreachable. Operand 313 states. [2019-05-23 10:10:21,607 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-05-23 10:10:21,607 INFO L146 ILogger]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2019-05-23 10:10:21,608 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:21,608 INFO L146 ILogger]: Abstraction has 313 states and 313 transitions. [2019-05-23 10:10:21,608 INFO L146 ILogger]: Interpolant automaton has 155 states. [2019-05-23 10:10:21,608 INFO L146 ILogger]: Start isEmpty. Operand 313 states and 313 transitions. [2019-05-23 10:10:21,609 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 313 [2019-05-23 10:10:21,609 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:21,609 INFO L146 ILogger]: trace histogram [153, 153, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:21,609 INFO L146 ILogger]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:21,610 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:21,610 INFO L146 ILogger]: Analyzing trace with hash -1665731853, now seen corresponding path program 153 times [2019-05-23 10:10:21,610 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:21,628 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:21,631 INFO L146 ILogger]: Trace formula consists of 489 conjuncts, 155 conjunts are in the unsatisfiable core [2019-05-23 10:10:21,632 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:29,212 INFO L146 ILogger]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:29,213 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:29,213 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2019-05-23 10:10:29,213 INFO L146 ILogger]: Interpolant automaton has 156 states [2019-05-23 10:10:29,214 INFO L146 ILogger]: Constructing interpolant automaton starting with 156 interpolants. [2019-05-23 10:10:29,215 INFO L146 ILogger]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-05-23 10:10:29,215 INFO L146 ILogger]: Start difference. First operand 313 states and 313 transitions. Second operand 156 states. [2019-05-23 10:10:29,756 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:29,756 INFO L146 ILogger]: Finished difference Result 316 states and 316 transitions. [2019-05-23 10:10:29,757 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-05-23 10:10:29,757 INFO L146 ILogger]: Start accepts. Automaton has 156 states. Word has length 312 [2019-05-23 10:10:29,757 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:29,758 INFO L146 ILogger]: With dead ends: 316 [2019-05-23 10:10:29,758 INFO L146 ILogger]: Without dead ends: 316 [2019-05-23 10:10:29,759 INFO L146 ILogger]: 0 DeclaredPredicates, 311 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-05-23 10:10:29,759 INFO L146 ILogger]: Start minimizeSevpa. Operand 316 states. [2019-05-23 10:10:29,760 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 316 to 315. [2019-05-23 10:10:29,760 INFO L146 ILogger]: Start removeUnreachable. Operand 315 states. [2019-05-23 10:10:29,761 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2019-05-23 10:10:29,761 INFO L146 ILogger]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2019-05-23 10:10:29,761 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:29,761 INFO L146 ILogger]: Abstraction has 315 states and 315 transitions. [2019-05-23 10:10:29,761 INFO L146 ILogger]: Interpolant automaton has 156 states. [2019-05-23 10:10:29,761 INFO L146 ILogger]: Start isEmpty. Operand 315 states and 315 transitions. [2019-05-23 10:10:29,762 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 315 [2019-05-23 10:10:29,762 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:29,762 INFO L146 ILogger]: trace histogram [154, 154, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:29,762 INFO L146 ILogger]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:29,762 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:29,763 INFO L146 ILogger]: Analyzing trace with hash 335526417, now seen corresponding path program 154 times [2019-05-23 10:10:29,763 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:29,781 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:29,784 INFO L146 ILogger]: Trace formula consists of 492 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 10:10:29,786 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:37,510 INFO L146 ILogger]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:37,511 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:37,511 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2019-05-23 10:10:37,511 INFO L146 ILogger]: Interpolant automaton has 157 states [2019-05-23 10:10:37,512 INFO L146 ILogger]: Constructing interpolant automaton starting with 157 interpolants. [2019-05-23 10:10:37,513 INFO L146 ILogger]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 10:10:37,513 INFO L146 ILogger]: Start difference. First operand 315 states and 315 transitions. Second operand 157 states. [2019-05-23 10:10:38,085 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:38,085 INFO L146 ILogger]: Finished difference Result 318 states and 318 transitions. [2019-05-23 10:10:38,085 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-05-23 10:10:38,085 INFO L146 ILogger]: Start accepts. Automaton has 157 states. Word has length 314 [2019-05-23 10:10:38,086 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:38,086 INFO L146 ILogger]: With dead ends: 318 [2019-05-23 10:10:38,087 INFO L146 ILogger]: Without dead ends: 318 [2019-05-23 10:10:38,088 INFO L146 ILogger]: 0 DeclaredPredicates, 313 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 10:10:38,088 INFO L146 ILogger]: Start minimizeSevpa. Operand 318 states. [2019-05-23 10:10:38,090 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-05-23 10:10:38,090 INFO L146 ILogger]: Start removeUnreachable. Operand 317 states. [2019-05-23 10:10:38,090 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-05-23 10:10:38,090 INFO L146 ILogger]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2019-05-23 10:10:38,091 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:38,091 INFO L146 ILogger]: Abstraction has 317 states and 317 transitions. [2019-05-23 10:10:38,091 INFO L146 ILogger]: Interpolant automaton has 157 states. [2019-05-23 10:10:38,091 INFO L146 ILogger]: Start isEmpty. Operand 317 states and 317 transitions. [2019-05-23 10:10:38,092 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 317 [2019-05-23 10:10:38,092 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:38,092 INFO L146 ILogger]: trace histogram [155, 155, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:38,092 INFO L146 ILogger]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:38,093 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:38,093 INFO L146 ILogger]: Analyzing trace with hash -600624721, now seen corresponding path program 155 times [2019-05-23 10:10:38,093 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:38,113 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:38,116 INFO L146 ILogger]: Trace formula consists of 495 conjuncts, 157 conjunts are in the unsatisfiable core [2019-05-23 10:10:38,117 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:45,918 INFO L146 ILogger]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:45,919 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:45,919 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2019-05-23 10:10:45,919 INFO L146 ILogger]: Interpolant automaton has 158 states [2019-05-23 10:10:45,920 INFO L146 ILogger]: Constructing interpolant automaton starting with 158 interpolants. [2019-05-23 10:10:45,921 INFO L146 ILogger]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-05-23 10:10:45,921 INFO L146 ILogger]: Start difference. First operand 317 states and 317 transitions. Second operand 158 states. [2019-05-23 10:10:46,481 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:46,482 INFO L146 ILogger]: Finished difference Result 320 states and 320 transitions. [2019-05-23 10:10:46,482 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-05-23 10:10:46,482 INFO L146 ILogger]: Start accepts. Automaton has 158 states. Word has length 316 [2019-05-23 10:10:46,483 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:46,483 INFO L146 ILogger]: With dead ends: 320 [2019-05-23 10:10:46,483 INFO L146 ILogger]: Without dead ends: 320 [2019-05-23 10:10:46,484 INFO L146 ILogger]: 0 DeclaredPredicates, 315 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-05-23 10:10:46,485 INFO L146 ILogger]: Start minimizeSevpa. Operand 320 states. [2019-05-23 10:10:46,487 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-05-23 10:10:46,487 INFO L146 ILogger]: Start removeUnreachable. Operand 319 states. [2019-05-23 10:10:46,487 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2019-05-23 10:10:46,487 INFO L146 ILogger]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2019-05-23 10:10:46,488 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:46,488 INFO L146 ILogger]: Abstraction has 319 states and 319 transitions. [2019-05-23 10:10:46,488 INFO L146 ILogger]: Interpolant automaton has 158 states. [2019-05-23 10:10:46,488 INFO L146 ILogger]: Start isEmpty. Operand 319 states and 319 transitions. [2019-05-23 10:10:46,489 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 319 [2019-05-23 10:10:46,489 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:46,489 INFO L146 ILogger]: trace histogram [156, 156, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:46,489 INFO L146 ILogger]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:46,490 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:46,490 INFO L146 ILogger]: Analyzing trace with hash 1701263821, now seen corresponding path program 156 times [2019-05-23 10:10:46,490 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:46,520 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:46,528 INFO L146 ILogger]: Trace formula consists of 498 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 10:10:46,532 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:10:54,689 INFO L146 ILogger]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:10:54,690 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:10:54,690 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2019-05-23 10:10:54,690 INFO L146 ILogger]: Interpolant automaton has 159 states [2019-05-23 10:10:54,691 INFO L146 ILogger]: Constructing interpolant automaton starting with 159 interpolants. [2019-05-23 10:10:54,692 INFO L146 ILogger]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 10:10:54,692 INFO L146 ILogger]: Start difference. First operand 319 states and 319 transitions. Second operand 159 states. [2019-05-23 10:10:55,259 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:10:55,259 INFO L146 ILogger]: Finished difference Result 322 states and 322 transitions. [2019-05-23 10:10:55,260 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-05-23 10:10:55,260 INFO L146 ILogger]: Start accepts. Automaton has 159 states. Word has length 318 [2019-05-23 10:10:55,260 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:10:55,261 INFO L146 ILogger]: With dead ends: 322 [2019-05-23 10:10:55,261 INFO L146 ILogger]: Without dead ends: 322 [2019-05-23 10:10:55,263 INFO L146 ILogger]: 0 DeclaredPredicates, 317 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 10:10:55,264 INFO L146 ILogger]: Start minimizeSevpa. Operand 322 states. [2019-05-23 10:10:55,265 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-05-23 10:10:55,265 INFO L146 ILogger]: Start removeUnreachable. Operand 321 states. [2019-05-23 10:10:55,266 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-05-23 10:10:55,266 INFO L146 ILogger]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2019-05-23 10:10:55,266 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:10:55,266 INFO L146 ILogger]: Abstraction has 321 states and 321 transitions. [2019-05-23 10:10:55,266 INFO L146 ILogger]: Interpolant automaton has 159 states. [2019-05-23 10:10:55,267 INFO L146 ILogger]: Start isEmpty. Operand 321 states and 321 transitions. [2019-05-23 10:10:55,268 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 321 [2019-05-23 10:10:55,268 INFO L146 ILogger]: Found error trace [2019-05-23 10:10:55,268 INFO L146 ILogger]: trace histogram [157, 157, 1, 1, 1, 1, 1, 1] [2019-05-23 10:10:55,268 INFO L146 ILogger]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:10:55,268 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:10:55,268 INFO L146 ILogger]: Analyzing trace with hash 1907995243, now seen corresponding path program 157 times [2019-05-23 10:10:55,269 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:10:55,301 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:10:55,307 INFO L146 ILogger]: Trace formula consists of 501 conjuncts, 159 conjunts are in the unsatisfiable core [2019-05-23 10:10:55,310 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:03,443 INFO L146 ILogger]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:03,443 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:03,443 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2019-05-23 10:11:03,444 INFO L146 ILogger]: Interpolant automaton has 160 states [2019-05-23 10:11:03,445 INFO L146 ILogger]: Constructing interpolant automaton starting with 160 interpolants. [2019-05-23 10:11:03,445 INFO L146 ILogger]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 10:11:03,445 INFO L146 ILogger]: Start difference. First operand 321 states and 321 transitions. Second operand 160 states. [2019-05-23 10:11:04,005 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:04,005 INFO L146 ILogger]: Finished difference Result 324 states and 324 transitions. [2019-05-23 10:11:04,005 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-05-23 10:11:04,005 INFO L146 ILogger]: Start accepts. Automaton has 160 states. Word has length 320 [2019-05-23 10:11:04,006 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:04,006 INFO L146 ILogger]: With dead ends: 324 [2019-05-23 10:11:04,006 INFO L146 ILogger]: Without dead ends: 324 [2019-05-23 10:11:04,007 INFO L146 ILogger]: 0 DeclaredPredicates, 319 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 10:11:04,008 INFO L146 ILogger]: Start minimizeSevpa. Operand 324 states. [2019-05-23 10:11:04,009 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 324 to 323. [2019-05-23 10:11:04,010 INFO L146 ILogger]: Start removeUnreachable. Operand 323 states. [2019-05-23 10:11:04,010 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2019-05-23 10:11:04,010 INFO L146 ILogger]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2019-05-23 10:11:04,010 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:04,011 INFO L146 ILogger]: Abstraction has 323 states and 323 transitions. [2019-05-23 10:11:04,011 INFO L146 ILogger]: Interpolant automaton has 160 states. [2019-05-23 10:11:04,011 INFO L146 ILogger]: Start isEmpty. Operand 323 states and 323 transitions. [2019-05-23 10:11:04,011 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 323 [2019-05-23 10:11:04,012 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:04,012 INFO L146 ILogger]: trace histogram [158, 158, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:04,012 INFO L146 ILogger]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:04,012 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:04,012 INFO L146 ILogger]: Analyzing trace with hash -1286571127, now seen corresponding path program 158 times [2019-05-23 10:11:04,012 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:04,031 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:04,034 INFO L146 ILogger]: Trace formula consists of 504 conjuncts, 160 conjunts are in the unsatisfiable core [2019-05-23 10:11:04,036 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:12,103 INFO L146 ILogger]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:12,103 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:12,103 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2019-05-23 10:11:12,104 INFO L146 ILogger]: Interpolant automaton has 161 states [2019-05-23 10:11:12,105 INFO L146 ILogger]: Constructing interpolant automaton starting with 161 interpolants. [2019-05-23 10:11:12,105 INFO L146 ILogger]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 10:11:12,106 INFO L146 ILogger]: Start difference. First operand 323 states and 323 transitions. Second operand 161 states. [2019-05-23 10:11:12,741 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:12,742 INFO L146 ILogger]: Finished difference Result 326 states and 326 transitions. [2019-05-23 10:11:12,742 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-05-23 10:11:12,742 INFO L146 ILogger]: Start accepts. Automaton has 161 states. Word has length 322 [2019-05-23 10:11:12,743 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:12,743 INFO L146 ILogger]: With dead ends: 326 [2019-05-23 10:11:12,743 INFO L146 ILogger]: Without dead ends: 326 [2019-05-23 10:11:12,744 INFO L146 ILogger]: 0 DeclaredPredicates, 321 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 10:11:12,745 INFO L146 ILogger]: Start minimizeSevpa. Operand 326 states. [2019-05-23 10:11:12,747 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-05-23 10:11:12,747 INFO L146 ILogger]: Start removeUnreachable. Operand 325 states. [2019-05-23 10:11:12,748 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-05-23 10:11:12,748 INFO L146 ILogger]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2019-05-23 10:11:12,748 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:12,748 INFO L146 ILogger]: Abstraction has 325 states and 325 transitions. [2019-05-23 10:11:12,748 INFO L146 ILogger]: Interpolant automaton has 161 states. [2019-05-23 10:11:12,748 INFO L146 ILogger]: Start isEmpty. Operand 325 states and 325 transitions. [2019-05-23 10:11:12,749 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 325 [2019-05-23 10:11:12,749 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:12,750 INFO L146 ILogger]: trace histogram [159, 159, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:12,750 INFO L146 ILogger]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:12,750 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:12,750 INFO L146 ILogger]: Analyzing trace with hash -363236057, now seen corresponding path program 159 times [2019-05-23 10:11:12,751 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:12,781 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:12,786 INFO L146 ILogger]: Trace formula consists of 507 conjuncts, 161 conjunts are in the unsatisfiable core [2019-05-23 10:11:12,788 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:21,133 INFO L146 ILogger]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:21,133 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:21,133 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2019-05-23 10:11:21,133 INFO L146 ILogger]: Interpolant automaton has 162 states [2019-05-23 10:11:21,135 INFO L146 ILogger]: Constructing interpolant automaton starting with 162 interpolants. [2019-05-23 10:11:21,135 INFO L146 ILogger]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-05-23 10:11:21,135 INFO L146 ILogger]: Start difference. First operand 325 states and 325 transitions. Second operand 162 states. [2019-05-23 10:11:21,722 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:21,722 INFO L146 ILogger]: Finished difference Result 328 states and 328 transitions. [2019-05-23 10:11:21,722 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-05-23 10:11:21,723 INFO L146 ILogger]: Start accepts. Automaton has 162 states. Word has length 324 [2019-05-23 10:11:21,723 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:21,723 INFO L146 ILogger]: With dead ends: 328 [2019-05-23 10:11:21,724 INFO L146 ILogger]: Without dead ends: 328 [2019-05-23 10:11:21,725 INFO L146 ILogger]: 0 DeclaredPredicates, 323 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-05-23 10:11:21,725 INFO L146 ILogger]: Start minimizeSevpa. Operand 328 states. [2019-05-23 10:11:21,727 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 328 to 327. [2019-05-23 10:11:21,727 INFO L146 ILogger]: Start removeUnreachable. Operand 327 states. [2019-05-23 10:11:21,727 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-05-23 10:11:21,728 INFO L146 ILogger]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2019-05-23 10:11:21,728 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:21,728 INFO L146 ILogger]: Abstraction has 327 states and 327 transitions. [2019-05-23 10:11:21,728 INFO L146 ILogger]: Interpolant automaton has 162 states. [2019-05-23 10:11:21,728 INFO L146 ILogger]: Start isEmpty. Operand 327 states and 327 transitions. [2019-05-23 10:11:21,729 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 327 [2019-05-23 10:11:21,729 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:21,729 INFO L146 ILogger]: trace histogram [160, 160, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:21,729 INFO L146 ILogger]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:21,729 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:21,729 INFO L146 ILogger]: Analyzing trace with hash -2096464059, now seen corresponding path program 160 times [2019-05-23 10:11:21,730 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:21,749 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:21,754 INFO L146 ILogger]: Trace formula consists of 510 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 10:11:21,756 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:30,070 INFO L146 ILogger]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:30,070 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:30,070 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2019-05-23 10:11:30,071 INFO L146 ILogger]: Interpolant automaton has 163 states [2019-05-23 10:11:30,072 INFO L146 ILogger]: Constructing interpolant automaton starting with 163 interpolants. [2019-05-23 10:11:30,073 INFO L146 ILogger]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 10:11:30,073 INFO L146 ILogger]: Start difference. First operand 327 states and 327 transitions. Second operand 163 states. [2019-05-23 10:11:30,671 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:30,671 INFO L146 ILogger]: Finished difference Result 330 states and 330 transitions. [2019-05-23 10:11:30,671 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-05-23 10:11:30,672 INFO L146 ILogger]: Start accepts. Automaton has 163 states. Word has length 326 [2019-05-23 10:11:30,672 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:30,672 INFO L146 ILogger]: With dead ends: 330 [2019-05-23 10:11:30,672 INFO L146 ILogger]: Without dead ends: 330 [2019-05-23 10:11:30,674 INFO L146 ILogger]: 0 DeclaredPredicates, 325 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 10:11:30,674 INFO L146 ILogger]: Start minimizeSevpa. Operand 330 states. [2019-05-23 10:11:30,676 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-05-23 10:11:30,676 INFO L146 ILogger]: Start removeUnreachable. Operand 329 states. [2019-05-23 10:11:30,677 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-05-23 10:11:30,677 INFO L146 ILogger]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2019-05-23 10:11:30,677 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:30,677 INFO L146 ILogger]: Abstraction has 329 states and 329 transitions. [2019-05-23 10:11:30,677 INFO L146 ILogger]: Interpolant automaton has 163 states. [2019-05-23 10:11:30,678 INFO L146 ILogger]: Start isEmpty. Operand 329 states and 329 transitions. [2019-05-23 10:11:30,679 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 329 [2019-05-23 10:11:30,679 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:30,679 INFO L146 ILogger]: trace histogram [161, 161, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:30,679 INFO L146 ILogger]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:30,679 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:30,679 INFO L146 ILogger]: Analyzing trace with hash -1281263133, now seen corresponding path program 161 times [2019-05-23 10:11:30,680 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:30,709 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:30,712 INFO L146 ILogger]: Trace formula consists of 513 conjuncts, 163 conjunts are in the unsatisfiable core [2019-05-23 10:11:30,714 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:39,120 INFO L146 ILogger]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:39,120 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:39,120 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2019-05-23 10:11:39,121 INFO L146 ILogger]: Interpolant automaton has 164 states [2019-05-23 10:11:39,122 INFO L146 ILogger]: Constructing interpolant automaton starting with 164 interpolants. [2019-05-23 10:11:39,122 INFO L146 ILogger]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 10:11:39,122 INFO L146 ILogger]: Start difference. First operand 329 states and 329 transitions. Second operand 164 states. [2019-05-23 10:11:39,706 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:39,706 INFO L146 ILogger]: Finished difference Result 332 states and 332 transitions. [2019-05-23 10:11:39,706 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-05-23 10:11:39,707 INFO L146 ILogger]: Start accepts. Automaton has 164 states. Word has length 328 [2019-05-23 10:11:39,707 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:39,707 INFO L146 ILogger]: With dead ends: 332 [2019-05-23 10:11:39,707 INFO L146 ILogger]: Without dead ends: 332 [2019-05-23 10:11:39,708 INFO L146 ILogger]: 0 DeclaredPredicates, 327 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 10:11:39,709 INFO L146 ILogger]: Start minimizeSevpa. Operand 332 states. [2019-05-23 10:11:39,711 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 332 to 331. [2019-05-23 10:11:39,711 INFO L146 ILogger]: Start removeUnreachable. Operand 331 states. [2019-05-23 10:11:39,711 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-05-23 10:11:39,711 INFO L146 ILogger]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2019-05-23 10:11:39,712 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:39,712 INFO L146 ILogger]: Abstraction has 331 states and 331 transitions. [2019-05-23 10:11:39,712 INFO L146 ILogger]: Interpolant automaton has 164 states. [2019-05-23 10:11:39,712 INFO L146 ILogger]: Start isEmpty. Operand 331 states and 331 transitions. [2019-05-23 10:11:39,713 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 331 [2019-05-23 10:11:39,713 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:39,713 INFO L146 ILogger]: trace histogram [162, 162, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:39,714 INFO L146 ILogger]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:39,714 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:39,714 INFO L146 ILogger]: Analyzing trace with hash 442778881, now seen corresponding path program 162 times [2019-05-23 10:11:39,714 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:39,739 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:39,743 INFO L146 ILogger]: Trace formula consists of 516 conjuncts, 164 conjunts are in the unsatisfiable core [2019-05-23 10:11:39,744 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:48,259 INFO L146 ILogger]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:48,259 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:48,259 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2019-05-23 10:11:48,260 INFO L146 ILogger]: Interpolant automaton has 165 states [2019-05-23 10:11:48,261 INFO L146 ILogger]: Constructing interpolant automaton starting with 165 interpolants. [2019-05-23 10:11:48,261 INFO L146 ILogger]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 10:11:48,261 INFO L146 ILogger]: Start difference. First operand 331 states and 331 transitions. Second operand 165 states. [2019-05-23 10:11:48,885 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:48,886 INFO L146 ILogger]: Finished difference Result 334 states and 334 transitions. [2019-05-23 10:11:48,886 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-05-23 10:11:48,886 INFO L146 ILogger]: Start accepts. Automaton has 165 states. Word has length 330 [2019-05-23 10:11:48,887 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:48,887 INFO L146 ILogger]: With dead ends: 334 [2019-05-23 10:11:48,887 INFO L146 ILogger]: Without dead ends: 334 [2019-05-23 10:11:48,888 INFO L146 ILogger]: 0 DeclaredPredicates, 329 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 10:11:48,889 INFO L146 ILogger]: Start minimizeSevpa. Operand 334 states. [2019-05-23 10:11:48,890 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-05-23 10:11:48,891 INFO L146 ILogger]: Start removeUnreachable. Operand 333 states. [2019-05-23 10:11:48,891 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-05-23 10:11:48,891 INFO L146 ILogger]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2019-05-23 10:11:48,891 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:48,891 INFO L146 ILogger]: Abstraction has 333 states and 333 transitions. [2019-05-23 10:11:48,891 INFO L146 ILogger]: Interpolant automaton has 165 states. [2019-05-23 10:11:48,891 INFO L146 ILogger]: Start isEmpty. Operand 333 states and 333 transitions. [2019-05-23 10:11:48,892 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 333 [2019-05-23 10:11:48,892 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:48,892 INFO L146 ILogger]: trace histogram [163, 163, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:48,892 INFO L146 ILogger]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:48,893 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:48,893 INFO L146 ILogger]: Analyzing trace with hash -610221921, now seen corresponding path program 163 times [2019-05-23 10:11:48,893 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:48,915 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:48,918 INFO L146 ILogger]: Trace formula consists of 519 conjuncts, 165 conjunts are in the unsatisfiable core [2019-05-23 10:11:48,920 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:11:57,524 INFO L146 ILogger]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:11:57,524 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:11:57,524 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2019-05-23 10:11:57,524 INFO L146 ILogger]: Interpolant automaton has 166 states [2019-05-23 10:11:57,526 INFO L146 ILogger]: Constructing interpolant automaton starting with 166 interpolants. [2019-05-23 10:11:57,526 INFO L146 ILogger]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-05-23 10:11:57,526 INFO L146 ILogger]: Start difference. First operand 333 states and 333 transitions. Second operand 166 states. [2019-05-23 10:11:58,154 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:11:58,154 INFO L146 ILogger]: Finished difference Result 336 states and 336 transitions. [2019-05-23 10:11:58,155 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-05-23 10:11:58,155 INFO L146 ILogger]: Start accepts. Automaton has 166 states. Word has length 332 [2019-05-23 10:11:58,155 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:11:58,156 INFO L146 ILogger]: With dead ends: 336 [2019-05-23 10:11:58,156 INFO L146 ILogger]: Without dead ends: 336 [2019-05-23 10:11:58,157 INFO L146 ILogger]: 0 DeclaredPredicates, 331 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-05-23 10:11:58,158 INFO L146 ILogger]: Start minimizeSevpa. Operand 336 states. [2019-05-23 10:11:58,160 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-05-23 10:11:58,160 INFO L146 ILogger]: Start removeUnreachable. Operand 335 states. [2019-05-23 10:11:58,161 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2019-05-23 10:11:58,161 INFO L146 ILogger]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2019-05-23 10:11:58,161 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:11:58,161 INFO L146 ILogger]: Abstraction has 335 states and 335 transitions. [2019-05-23 10:11:58,162 INFO L146 ILogger]: Interpolant automaton has 166 states. [2019-05-23 10:11:58,162 INFO L146 ILogger]: Start isEmpty. Operand 335 states and 335 transitions. [2019-05-23 10:11:58,163 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 335 [2019-05-23 10:11:58,163 INFO L146 ILogger]: Found error trace [2019-05-23 10:11:58,163 INFO L146 ILogger]: trace histogram [164, 164, 1, 1, 1, 1, 1, 1] [2019-05-23 10:11:58,163 INFO L146 ILogger]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:11:58,163 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:11:58,164 INFO L146 ILogger]: Analyzing trace with hash 1068289213, now seen corresponding path program 164 times [2019-05-23 10:11:58,164 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:11:58,198 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:11:58,206 INFO L146 ILogger]: Trace formula consists of 522 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 10:11:58,209 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:07,033 INFO L146 ILogger]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:07,033 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:07,033 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2019-05-23 10:12:07,034 INFO L146 ILogger]: Interpolant automaton has 167 states [2019-05-23 10:12:07,035 INFO L146 ILogger]: Constructing interpolant automaton starting with 167 interpolants. [2019-05-23 10:12:07,035 INFO L146 ILogger]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 10:12:07,035 INFO L146 ILogger]: Start difference. First operand 335 states and 335 transitions. Second operand 167 states. [2019-05-23 10:12:07,638 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:07,638 INFO L146 ILogger]: Finished difference Result 338 states and 338 transitions. [2019-05-23 10:12:07,639 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-05-23 10:12:07,639 INFO L146 ILogger]: Start accepts. Automaton has 167 states. Word has length 334 [2019-05-23 10:12:07,639 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:07,640 INFO L146 ILogger]: With dead ends: 338 [2019-05-23 10:12:07,640 INFO L146 ILogger]: Without dead ends: 338 [2019-05-23 10:12:07,641 INFO L146 ILogger]: 0 DeclaredPredicates, 333 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 10:12:07,641 INFO L146 ILogger]: Start minimizeSevpa. Operand 338 states. [2019-05-23 10:12:07,643 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-05-23 10:12:07,643 INFO L146 ILogger]: Start removeUnreachable. Operand 337 states. [2019-05-23 10:12:07,644 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-05-23 10:12:07,644 INFO L146 ILogger]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2019-05-23 10:12:07,644 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:07,644 INFO L146 ILogger]: Abstraction has 337 states and 337 transitions. [2019-05-23 10:12:07,644 INFO L146 ILogger]: Interpolant automaton has 167 states. [2019-05-23 10:12:07,644 INFO L146 ILogger]: Start isEmpty. Operand 337 states and 337 transitions. [2019-05-23 10:12:07,646 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 337 [2019-05-23 10:12:07,646 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:07,646 INFO L146 ILogger]: trace histogram [165, 165, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:07,646 INFO L146 ILogger]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:07,646 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:07,646 INFO L146 ILogger]: Analyzing trace with hash -790214309, now seen corresponding path program 165 times [2019-05-23 10:12:07,647 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:07,669 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:07,673 INFO L146 ILogger]: Trace formula consists of 525 conjuncts, 167 conjunts are in the unsatisfiable core [2019-05-23 10:12:07,674 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:16,452 INFO L146 ILogger]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:16,453 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:16,453 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2019-05-23 10:12:16,453 INFO L146 ILogger]: Interpolant automaton has 168 states [2019-05-23 10:12:16,454 INFO L146 ILogger]: Constructing interpolant automaton starting with 168 interpolants. [2019-05-23 10:12:16,455 INFO L146 ILogger]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-05-23 10:12:16,455 INFO L146 ILogger]: Start difference. First operand 337 states and 337 transitions. Second operand 168 states. [2019-05-23 10:12:17,080 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:17,080 INFO L146 ILogger]: Finished difference Result 340 states and 340 transitions. [2019-05-23 10:12:17,080 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-05-23 10:12:17,080 INFO L146 ILogger]: Start accepts. Automaton has 168 states. Word has length 336 [2019-05-23 10:12:17,081 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:17,081 INFO L146 ILogger]: With dead ends: 340 [2019-05-23 10:12:17,081 INFO L146 ILogger]: Without dead ends: 340 [2019-05-23 10:12:17,083 INFO L146 ILogger]: 0 DeclaredPredicates, 335 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-05-23 10:12:17,083 INFO L146 ILogger]: Start minimizeSevpa. Operand 340 states. [2019-05-23 10:12:17,085 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-05-23 10:12:17,085 INFO L146 ILogger]: Start removeUnreachable. Operand 339 states. [2019-05-23 10:12:17,085 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2019-05-23 10:12:17,085 INFO L146 ILogger]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2019-05-23 10:12:17,086 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:17,086 INFO L146 ILogger]: Abstraction has 339 states and 339 transitions. [2019-05-23 10:12:17,086 INFO L146 ILogger]: Interpolant automaton has 168 states. [2019-05-23 10:12:17,086 INFO L146 ILogger]: Start isEmpty. Operand 339 states and 339 transitions. [2019-05-23 10:12:17,087 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 339 [2019-05-23 10:12:17,087 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:17,087 INFO L146 ILogger]: trace histogram [166, 166, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:17,087 INFO L146 ILogger]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:17,087 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:17,087 INFO L146 ILogger]: Analyzing trace with hash -105703815, now seen corresponding path program 166 times [2019-05-23 10:12:17,088 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:17,107 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:17,111 INFO L146 ILogger]: Trace formula consists of 528 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 10:12:17,112 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:25,993 INFO L146 ILogger]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:25,994 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:25,994 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2019-05-23 10:12:25,994 INFO L146 ILogger]: Interpolant automaton has 169 states [2019-05-23 10:12:25,995 INFO L146 ILogger]: Constructing interpolant automaton starting with 169 interpolants. [2019-05-23 10:12:25,996 INFO L146 ILogger]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 10:12:25,996 INFO L146 ILogger]: Start difference. First operand 339 states and 339 transitions. Second operand 169 states. [2019-05-23 10:12:26,609 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:26,610 INFO L146 ILogger]: Finished difference Result 342 states and 342 transitions. [2019-05-23 10:12:26,610 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-05-23 10:12:26,610 INFO L146 ILogger]: Start accepts. Automaton has 169 states. Word has length 338 [2019-05-23 10:12:26,610 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:26,611 INFO L146 ILogger]: With dead ends: 342 [2019-05-23 10:12:26,611 INFO L146 ILogger]: Without dead ends: 342 [2019-05-23 10:12:26,612 INFO L146 ILogger]: 0 DeclaredPredicates, 337 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 10:12:26,613 INFO L146 ILogger]: Start minimizeSevpa. Operand 342 states. [2019-05-23 10:12:26,614 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-05-23 10:12:26,614 INFO L146 ILogger]: Start removeUnreachable. Operand 341 states. [2019-05-23 10:12:26,614 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-05-23 10:12:26,614 INFO L146 ILogger]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2019-05-23 10:12:26,614 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:26,615 INFO L146 ILogger]: Abstraction has 341 states and 341 transitions. [2019-05-23 10:12:26,615 INFO L146 ILogger]: Interpolant automaton has 169 states. [2019-05-23 10:12:26,615 INFO L146 ILogger]: Start isEmpty. Operand 341 states and 341 transitions. [2019-05-23 10:12:26,616 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 341 [2019-05-23 10:12:26,616 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:26,616 INFO L146 ILogger]: trace histogram [167, 167, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:26,616 INFO L146 ILogger]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:26,616 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:26,616 INFO L146 ILogger]: Analyzing trace with hash 578884631, now seen corresponding path program 167 times [2019-05-23 10:12:26,616 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:26,637 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:26,641 INFO L146 ILogger]: Trace formula consists of 531 conjuncts, 169 conjunts are in the unsatisfiable core [2019-05-23 10:12:26,642 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:35,616 INFO L146 ILogger]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:35,616 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:35,616 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2019-05-23 10:12:35,616 INFO L146 ILogger]: Interpolant automaton has 170 states [2019-05-23 10:12:35,618 INFO L146 ILogger]: Constructing interpolant automaton starting with 170 interpolants. [2019-05-23 10:12:35,618 INFO L146 ILogger]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-05-23 10:12:35,619 INFO L146 ILogger]: Start difference. First operand 341 states and 341 transitions. Second operand 170 states. [2019-05-23 10:12:36,277 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:36,278 INFO L146 ILogger]: Finished difference Result 344 states and 344 transitions. [2019-05-23 10:12:36,278 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-05-23 10:12:36,278 INFO L146 ILogger]: Start accepts. Automaton has 170 states. Word has length 340 [2019-05-23 10:12:36,279 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:36,279 INFO L146 ILogger]: With dead ends: 344 [2019-05-23 10:12:36,279 INFO L146 ILogger]: Without dead ends: 344 [2019-05-23 10:12:36,281 INFO L146 ILogger]: 0 DeclaredPredicates, 339 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-05-23 10:12:36,281 INFO L146 ILogger]: Start minimizeSevpa. Operand 344 states. [2019-05-23 10:12:36,283 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 344 to 343. [2019-05-23 10:12:36,283 INFO L146 ILogger]: Start removeUnreachable. Operand 343 states. [2019-05-23 10:12:36,284 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2019-05-23 10:12:36,284 INFO L146 ILogger]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2019-05-23 10:12:36,284 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:36,284 INFO L146 ILogger]: Abstraction has 343 states and 343 transitions. [2019-05-23 10:12:36,284 INFO L146 ILogger]: Interpolant automaton has 170 states. [2019-05-23 10:12:36,284 INFO L146 ILogger]: Start isEmpty. Operand 343 states and 343 transitions. [2019-05-23 10:12:36,285 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 343 [2019-05-23 10:12:36,285 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:36,285 INFO L146 ILogger]: trace histogram [168, 168, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:36,285 INFO L146 ILogger]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:36,285 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:36,286 INFO L146 ILogger]: Analyzing trace with hash 1338384949, now seen corresponding path program 168 times [2019-05-23 10:12:36,286 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:36,306 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:36,312 INFO L146 ILogger]: Trace formula consists of 534 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 10:12:36,314 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:45,455 INFO L146 ILogger]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:45,456 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:45,456 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2019-05-23 10:12:45,456 INFO L146 ILogger]: Interpolant automaton has 171 states [2019-05-23 10:12:45,457 INFO L146 ILogger]: Constructing interpolant automaton starting with 171 interpolants. [2019-05-23 10:12:45,458 INFO L146 ILogger]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 10:12:45,458 INFO L146 ILogger]: Start difference. First operand 343 states and 343 transitions. Second operand 171 states. [2019-05-23 10:12:46,113 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:46,113 INFO L146 ILogger]: Finished difference Result 346 states and 346 transitions. [2019-05-23 10:12:46,113 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-05-23 10:12:46,113 INFO L146 ILogger]: Start accepts. Automaton has 171 states. Word has length 342 [2019-05-23 10:12:46,114 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:46,114 INFO L146 ILogger]: With dead ends: 346 [2019-05-23 10:12:46,114 INFO L146 ILogger]: Without dead ends: 346 [2019-05-23 10:12:46,115 INFO L146 ILogger]: 0 DeclaredPredicates, 341 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 10:12:46,116 INFO L146 ILogger]: Start minimizeSevpa. Operand 346 states. [2019-05-23 10:12:46,117 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-05-23 10:12:46,117 INFO L146 ILogger]: Start removeUnreachable. Operand 345 states. [2019-05-23 10:12:46,118 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-05-23 10:12:46,118 INFO L146 ILogger]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2019-05-23 10:12:46,118 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:46,118 INFO L146 ILogger]: Abstraction has 345 states and 345 transitions. [2019-05-23 10:12:46,119 INFO L146 ILogger]: Interpolant automaton has 171 states. [2019-05-23 10:12:46,119 INFO L146 ILogger]: Start isEmpty. Operand 345 states and 345 transitions. [2019-05-23 10:12:46,120 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 345 [2019-05-23 10:12:46,120 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:46,120 INFO L146 ILogger]: trace histogram [169, 169, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:46,120 INFO L146 ILogger]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:46,120 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:46,120 INFO L146 ILogger]: Analyzing trace with hash 1073750227, now seen corresponding path program 169 times [2019-05-23 10:12:46,120 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:46,142 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:46,146 INFO L146 ILogger]: Trace formula consists of 537 conjuncts, 171 conjunts are in the unsatisfiable core [2019-05-23 10:12:46,147 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:12:55,371 INFO L146 ILogger]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:12:55,371 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:12:55,371 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2019-05-23 10:12:55,371 INFO L146 ILogger]: Interpolant automaton has 172 states [2019-05-23 10:12:55,373 INFO L146 ILogger]: Constructing interpolant automaton starting with 172 interpolants. [2019-05-23 10:12:55,373 INFO L146 ILogger]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 10:12:55,373 INFO L146 ILogger]: Start difference. First operand 345 states and 345 transitions. Second operand 172 states. [2019-05-23 10:12:56,016 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:12:56,016 INFO L146 ILogger]: Finished difference Result 348 states and 348 transitions. [2019-05-23 10:12:56,016 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-05-23 10:12:56,017 INFO L146 ILogger]: Start accepts. Automaton has 172 states. Word has length 344 [2019-05-23 10:12:56,017 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:12:56,017 INFO L146 ILogger]: With dead ends: 348 [2019-05-23 10:12:56,018 INFO L146 ILogger]: Without dead ends: 348 [2019-05-23 10:12:56,019 INFO L146 ILogger]: 0 DeclaredPredicates, 343 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 10:12:56,019 INFO L146 ILogger]: Start minimizeSevpa. Operand 348 states. [2019-05-23 10:12:56,021 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-05-23 10:12:56,021 INFO L146 ILogger]: Start removeUnreachable. Operand 347 states. [2019-05-23 10:12:56,021 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-05-23 10:12:56,021 INFO L146 ILogger]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2019-05-23 10:12:56,021 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:12:56,021 INFO L146 ILogger]: Abstraction has 347 states and 347 transitions. [2019-05-23 10:12:56,021 INFO L146 ILogger]: Interpolant automaton has 172 states. [2019-05-23 10:12:56,022 INFO L146 ILogger]: Start isEmpty. Operand 347 states and 347 transitions. [2019-05-23 10:12:56,022 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 347 [2019-05-23 10:12:56,022 INFO L146 ILogger]: Found error trace [2019-05-23 10:12:56,023 INFO L146 ILogger]: trace histogram [170, 170, 1, 1, 1, 1, 1, 1] [2019-05-23 10:12:56,023 INFO L146 ILogger]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:12:56,023 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:12:56,023 INFO L146 ILogger]: Analyzing trace with hash 162852849, now seen corresponding path program 170 times [2019-05-23 10:12:56,023 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:12:56,044 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:12:56,048 INFO L146 ILogger]: Trace formula consists of 540 conjuncts, 172 conjunts are in the unsatisfiable core [2019-05-23 10:12:56,050 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:05,299 INFO L146 ILogger]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:05,300 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:05,300 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2019-05-23 10:13:05,300 INFO L146 ILogger]: Interpolant automaton has 173 states [2019-05-23 10:13:05,302 INFO L146 ILogger]: Constructing interpolant automaton starting with 173 interpolants. [2019-05-23 10:13:05,302 INFO L146 ILogger]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 10:13:05,302 INFO L146 ILogger]: Start difference. First operand 347 states and 347 transitions. Second operand 173 states. [2019-05-23 10:13:05,978 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:05,979 INFO L146 ILogger]: Finished difference Result 350 states and 350 transitions. [2019-05-23 10:13:05,979 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-05-23 10:13:05,979 INFO L146 ILogger]: Start accepts. Automaton has 173 states. Word has length 346 [2019-05-23 10:13:05,980 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:05,980 INFO L146 ILogger]: With dead ends: 350 [2019-05-23 10:13:05,980 INFO L146 ILogger]: Without dead ends: 350 [2019-05-23 10:13:05,982 INFO L146 ILogger]: 0 DeclaredPredicates, 345 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 10:13:05,982 INFO L146 ILogger]: Start minimizeSevpa. Operand 350 states. [2019-05-23 10:13:05,983 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-05-23 10:13:05,983 INFO L146 ILogger]: Start removeUnreachable. Operand 349 states. [2019-05-23 10:13:05,984 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-05-23 10:13:05,984 INFO L146 ILogger]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2019-05-23 10:13:05,984 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:05,984 INFO L146 ILogger]: Abstraction has 349 states and 349 transitions. [2019-05-23 10:13:05,984 INFO L146 ILogger]: Interpolant automaton has 173 states. [2019-05-23 10:13:05,985 INFO L146 ILogger]: Start isEmpty. Operand 349 states and 349 transitions. [2019-05-23 10:13:05,985 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 349 [2019-05-23 10:13:05,986 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:05,986 INFO L146 ILogger]: trace histogram [171, 171, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:05,986 INFO L146 ILogger]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:05,986 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:05,986 INFO L146 ILogger]: Analyzing trace with hash 963800975, now seen corresponding path program 171 times [2019-05-23 10:13:05,986 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:06,008 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:06,012 INFO L146 ILogger]: Trace formula consists of 543 conjuncts, 173 conjunts are in the unsatisfiable core [2019-05-23 10:13:06,014 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:15,497 INFO L146 ILogger]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:15,498 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:15,498 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2019-05-23 10:13:15,498 INFO L146 ILogger]: Interpolant automaton has 174 states [2019-05-23 10:13:15,500 INFO L146 ILogger]: Constructing interpolant automaton starting with 174 interpolants. [2019-05-23 10:13:15,500 INFO L146 ILogger]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-05-23 10:13:15,500 INFO L146 ILogger]: Start difference. First operand 349 states and 349 transitions. Second operand 174 states. [2019-05-23 10:13:16,147 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:16,147 INFO L146 ILogger]: Finished difference Result 352 states and 352 transitions. [2019-05-23 10:13:16,147 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-05-23 10:13:16,148 INFO L146 ILogger]: Start accepts. Automaton has 174 states. Word has length 348 [2019-05-23 10:13:16,148 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:16,148 INFO L146 ILogger]: With dead ends: 352 [2019-05-23 10:13:16,148 INFO L146 ILogger]: Without dead ends: 352 [2019-05-23 10:13:16,150 INFO L146 ILogger]: 0 DeclaredPredicates, 347 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-05-23 10:13:16,151 INFO L146 ILogger]: Start minimizeSevpa. Operand 352 states. [2019-05-23 10:13:16,152 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-05-23 10:13:16,153 INFO L146 ILogger]: Start removeUnreachable. Operand 351 states. [2019-05-23 10:13:16,153 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-05-23 10:13:16,153 INFO L146 ILogger]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2019-05-23 10:13:16,153 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:16,153 INFO L146 ILogger]: Abstraction has 351 states and 351 transitions. [2019-05-23 10:13:16,153 INFO L146 ILogger]: Interpolant automaton has 174 states. [2019-05-23 10:13:16,153 INFO L146 ILogger]: Start isEmpty. Operand 351 states and 351 transitions. [2019-05-23 10:13:16,154 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 351 [2019-05-23 10:13:16,154 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:16,154 INFO L146 ILogger]: trace histogram [172, 172, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:16,154 INFO L146 ILogger]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:16,155 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:16,155 INFO L146 ILogger]: Analyzing trace with hash 1875804077, now seen corresponding path program 172 times [2019-05-23 10:13:16,155 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:16,176 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:16,180 INFO L146 ILogger]: Trace formula consists of 546 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 10:13:16,181 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:25,778 INFO L146 ILogger]: Checked inductivity of 29584 backedges. 0 proven. 29584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:25,778 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:25,779 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2019-05-23 10:13:25,779 INFO L146 ILogger]: Interpolant automaton has 175 states [2019-05-23 10:13:25,780 INFO L146 ILogger]: Constructing interpolant automaton starting with 175 interpolants. [2019-05-23 10:13:25,780 INFO L146 ILogger]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 10:13:25,780 INFO L146 ILogger]: Start difference. First operand 351 states and 351 transitions. Second operand 175 states. [2019-05-23 10:13:26,460 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:26,461 INFO L146 ILogger]: Finished difference Result 354 states and 354 transitions. [2019-05-23 10:13:26,461 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-05-23 10:13:26,461 INFO L146 ILogger]: Start accepts. Automaton has 175 states. Word has length 350 [2019-05-23 10:13:26,461 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:26,462 INFO L146 ILogger]: With dead ends: 354 [2019-05-23 10:13:26,462 INFO L146 ILogger]: Without dead ends: 354 [2019-05-23 10:13:26,463 INFO L146 ILogger]: 0 DeclaredPredicates, 349 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 10:13:26,463 INFO L146 ILogger]: Start minimizeSevpa. Operand 354 states. [2019-05-23 10:13:26,465 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-05-23 10:13:26,465 INFO L146 ILogger]: Start removeUnreachable. Operand 353 states. [2019-05-23 10:13:26,465 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-05-23 10:13:26,466 INFO L146 ILogger]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2019-05-23 10:13:26,466 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:26,466 INFO L146 ILogger]: Abstraction has 353 states and 353 transitions. [2019-05-23 10:13:26,466 INFO L146 ILogger]: Interpolant automaton has 175 states. [2019-05-23 10:13:26,466 INFO L146 ILogger]: Start isEmpty. Operand 353 states and 353 transitions. [2019-05-23 10:13:26,467 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 353 [2019-05-23 10:13:26,467 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:26,467 INFO L146 ILogger]: trace histogram [173, 173, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:26,467 INFO L146 ILogger]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:26,467 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:26,467 INFO L146 ILogger]: Analyzing trace with hash 2137456715, now seen corresponding path program 173 times [2019-05-23 10:13:26,468 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:26,489 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:26,493 INFO L146 ILogger]: Trace formula consists of 549 conjuncts, 175 conjunts are in the unsatisfiable core [2019-05-23 10:13:26,495 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:36,118 INFO L146 ILogger]: Checked inductivity of 29929 backedges. 0 proven. 29929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:36,118 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:36,118 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2019-05-23 10:13:36,118 INFO L146 ILogger]: Interpolant automaton has 176 states [2019-05-23 10:13:36,119 INFO L146 ILogger]: Constructing interpolant automaton starting with 176 interpolants. [2019-05-23 10:13:36,120 INFO L146 ILogger]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-05-23 10:13:36,120 INFO L146 ILogger]: Start difference. First operand 353 states and 353 transitions. Second operand 176 states. [2019-05-23 10:13:36,774 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:36,774 INFO L146 ILogger]: Finished difference Result 356 states and 356 transitions. [2019-05-23 10:13:36,775 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-05-23 10:13:36,775 INFO L146 ILogger]: Start accepts. Automaton has 176 states. Word has length 352 [2019-05-23 10:13:36,775 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:36,775 INFO L146 ILogger]: With dead ends: 356 [2019-05-23 10:13:36,776 INFO L146 ILogger]: Without dead ends: 356 [2019-05-23 10:13:36,777 INFO L146 ILogger]: 0 DeclaredPredicates, 351 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-05-23 10:13:36,777 INFO L146 ILogger]: Start minimizeSevpa. Operand 356 states. [2019-05-23 10:13:36,779 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 356 to 355. [2019-05-23 10:13:36,779 INFO L146 ILogger]: Start removeUnreachable. Operand 355 states. [2019-05-23 10:13:36,779 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2019-05-23 10:13:36,779 INFO L146 ILogger]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2019-05-23 10:13:36,779 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:36,780 INFO L146 ILogger]: Abstraction has 355 states and 355 transitions. [2019-05-23 10:13:36,780 INFO L146 ILogger]: Interpolant automaton has 176 states. [2019-05-23 10:13:36,780 INFO L146 ILogger]: Start isEmpty. Operand 355 states and 355 transitions. [2019-05-23 10:13:36,781 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 355 [2019-05-23 10:13:36,781 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:36,781 INFO L146 ILogger]: trace histogram [174, 174, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:36,781 INFO L146 ILogger]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:36,781 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:36,781 INFO L146 ILogger]: Analyzing trace with hash 182571369, now seen corresponding path program 174 times [2019-05-23 10:13:36,781 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:36,809 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:36,813 INFO L146 ILogger]: Trace formula consists of 552 conjuncts, 176 conjunts are in the unsatisfiable core [2019-05-23 10:13:36,814 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:46,588 INFO L146 ILogger]: Checked inductivity of 30276 backedges. 0 proven. 30276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:46,589 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:46,589 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2019-05-23 10:13:46,589 INFO L146 ILogger]: Interpolant automaton has 177 states [2019-05-23 10:13:46,590 INFO L146 ILogger]: Constructing interpolant automaton starting with 177 interpolants. [2019-05-23 10:13:46,591 INFO L146 ILogger]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 10:13:46,591 INFO L146 ILogger]: Start difference. First operand 355 states and 355 transitions. Second operand 177 states. [2019-05-23 10:13:47,299 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:47,300 INFO L146 ILogger]: Finished difference Result 358 states and 358 transitions. [2019-05-23 10:13:47,300 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-05-23 10:13:47,300 INFO L146 ILogger]: Start accepts. Automaton has 177 states. Word has length 354 [2019-05-23 10:13:47,301 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:47,301 INFO L146 ILogger]: With dead ends: 358 [2019-05-23 10:13:47,301 INFO L146 ILogger]: Without dead ends: 358 [2019-05-23 10:13:47,303 INFO L146 ILogger]: 0 DeclaredPredicates, 353 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 10:13:47,303 INFO L146 ILogger]: Start minimizeSevpa. Operand 358 states. [2019-05-23 10:13:47,305 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-05-23 10:13:47,305 INFO L146 ILogger]: Start removeUnreachable. Operand 357 states. [2019-05-23 10:13:47,305 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-05-23 10:13:47,305 INFO L146 ILogger]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2019-05-23 10:13:47,306 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:47,306 INFO L146 ILogger]: Abstraction has 357 states and 357 transitions. [2019-05-23 10:13:47,306 INFO L146 ILogger]: Interpolant automaton has 177 states. [2019-05-23 10:13:47,306 INFO L146 ILogger]: Start isEmpty. Operand 357 states and 357 transitions. [2019-05-23 10:13:47,307 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 357 [2019-05-23 10:13:47,307 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:47,307 INFO L146 ILogger]: trace histogram [175, 175, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:47,307 INFO L146 ILogger]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:47,307 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:47,307 INFO L146 ILogger]: Analyzing trace with hash -1561537785, now seen corresponding path program 175 times [2019-05-23 10:13:47,308 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:47,330 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:47,335 INFO L146 ILogger]: Trace formula consists of 555 conjuncts, 177 conjunts are in the unsatisfiable core [2019-05-23 10:13:47,337 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:13:57,211 INFO L146 ILogger]: Checked inductivity of 30625 backedges. 0 proven. 30625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:13:57,212 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:13:57,212 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2019-05-23 10:13:57,212 INFO L146 ILogger]: Interpolant automaton has 178 states [2019-05-23 10:13:57,214 INFO L146 ILogger]: Constructing interpolant automaton starting with 178 interpolants. [2019-05-23 10:13:57,214 INFO L146 ILogger]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-05-23 10:13:57,214 INFO L146 ILogger]: Start difference. First operand 357 states and 357 transitions. Second operand 178 states. [2019-05-23 10:13:57,918 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:13:57,918 INFO L146 ILogger]: Finished difference Result 360 states and 360 transitions. [2019-05-23 10:13:57,918 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-05-23 10:13:57,918 INFO L146 ILogger]: Start accepts. Automaton has 178 states. Word has length 356 [2019-05-23 10:13:57,919 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:13:57,919 INFO L146 ILogger]: With dead ends: 360 [2019-05-23 10:13:57,919 INFO L146 ILogger]: Without dead ends: 360 [2019-05-23 10:13:57,921 INFO L146 ILogger]: 0 DeclaredPredicates, 355 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-05-23 10:13:57,921 INFO L146 ILogger]: Start minimizeSevpa. Operand 360 states. [2019-05-23 10:13:57,923 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 360 to 359. [2019-05-23 10:13:57,923 INFO L146 ILogger]: Start removeUnreachable. Operand 359 states. [2019-05-23 10:13:57,923 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2019-05-23 10:13:57,924 INFO L146 ILogger]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2019-05-23 10:13:57,924 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:13:57,924 INFO L146 ILogger]: Abstraction has 359 states and 359 transitions. [2019-05-23 10:13:57,924 INFO L146 ILogger]: Interpolant automaton has 178 states. [2019-05-23 10:13:57,924 INFO L146 ILogger]: Start isEmpty. Operand 359 states and 359 transitions. [2019-05-23 10:13:57,925 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 359 [2019-05-23 10:13:57,925 INFO L146 ILogger]: Found error trace [2019-05-23 10:13:57,925 INFO L146 ILogger]: trace histogram [176, 176, 1, 1, 1, 1, 1, 1] [2019-05-23 10:13:57,925 INFO L146 ILogger]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:13:57,925 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:13:57,925 INFO L146 ILogger]: Analyzing trace with hash 1681777957, now seen corresponding path program 176 times [2019-05-23 10:13:57,926 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:13:57,948 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:13:57,952 INFO L146 ILogger]: Trace formula consists of 558 conjuncts, 178 conjunts are in the unsatisfiable core [2019-05-23 10:13:57,954 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:07,941 INFO L146 ILogger]: Checked inductivity of 30976 backedges. 0 proven. 30976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:07,942 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:07,942 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2019-05-23 10:14:07,942 INFO L146 ILogger]: Interpolant automaton has 179 states [2019-05-23 10:14:07,944 INFO L146 ILogger]: Constructing interpolant automaton starting with 179 interpolants. [2019-05-23 10:14:07,944 INFO L146 ILogger]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 10:14:07,945 INFO L146 ILogger]: Start difference. First operand 359 states and 359 transitions. Second operand 179 states. [2019-05-23 10:14:08,609 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:08,609 INFO L146 ILogger]: Finished difference Result 362 states and 362 transitions. [2019-05-23 10:14:08,610 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-05-23 10:14:08,610 INFO L146 ILogger]: Start accepts. Automaton has 179 states. Word has length 358 [2019-05-23 10:14:08,610 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:08,610 INFO L146 ILogger]: With dead ends: 362 [2019-05-23 10:14:08,610 INFO L146 ILogger]: Without dead ends: 362 [2019-05-23 10:14:08,611 INFO L146 ILogger]: 0 DeclaredPredicates, 357 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 10:14:08,611 INFO L146 ILogger]: Start minimizeSevpa. Operand 362 states. [2019-05-23 10:14:08,612 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-05-23 10:14:08,612 INFO L146 ILogger]: Start removeUnreachable. Operand 361 states. [2019-05-23 10:14:08,613 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-05-23 10:14:08,613 INFO L146 ILogger]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2019-05-23 10:14:08,613 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:08,613 INFO L146 ILogger]: Abstraction has 361 states and 361 transitions. [2019-05-23 10:14:08,613 INFO L146 ILogger]: Interpolant automaton has 179 states. [2019-05-23 10:14:08,613 INFO L146 ILogger]: Start isEmpty. Operand 361 states and 361 transitions. [2019-05-23 10:14:08,614 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 361 [2019-05-23 10:14:08,614 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:08,614 INFO L146 ILogger]: trace histogram [177, 177, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:08,614 INFO L146 ILogger]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:08,615 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:08,615 INFO L146 ILogger]: Analyzing trace with hash 361949123, now seen corresponding path program 177 times [2019-05-23 10:14:08,615 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:08,638 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:08,642 INFO L146 ILogger]: Trace formula consists of 561 conjuncts, 179 conjunts are in the unsatisfiable core [2019-05-23 10:14:08,644 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:18,714 INFO L146 ILogger]: Checked inductivity of 31329 backedges. 0 proven. 31329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:18,715 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:18,715 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2019-05-23 10:14:18,715 INFO L146 ILogger]: Interpolant automaton has 180 states [2019-05-23 10:14:18,716 INFO L146 ILogger]: Constructing interpolant automaton starting with 180 interpolants. [2019-05-23 10:14:18,717 INFO L146 ILogger]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-05-23 10:14:18,717 INFO L146 ILogger]: Start difference. First operand 361 states and 361 transitions. Second operand 180 states. [2019-05-23 10:14:19,451 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:19,452 INFO L146 ILogger]: Finished difference Result 364 states and 364 transitions. [2019-05-23 10:14:19,452 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-05-23 10:14:19,452 INFO L146 ILogger]: Start accepts. Automaton has 180 states. Word has length 360 [2019-05-23 10:14:19,453 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:19,453 INFO L146 ILogger]: With dead ends: 364 [2019-05-23 10:14:19,453 INFO L146 ILogger]: Without dead ends: 364 [2019-05-23 10:14:19,454 INFO L146 ILogger]: 0 DeclaredPredicates, 359 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-05-23 10:14:19,454 INFO L146 ILogger]: Start minimizeSevpa. Operand 364 states. [2019-05-23 10:14:19,456 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 364 to 363. [2019-05-23 10:14:19,456 INFO L146 ILogger]: Start removeUnreachable. Operand 363 states. [2019-05-23 10:14:19,456 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2019-05-23 10:14:19,456 INFO L146 ILogger]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 360 [2019-05-23 10:14:19,456 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:19,456 INFO L146 ILogger]: Abstraction has 363 states and 363 transitions. [2019-05-23 10:14:19,456 INFO L146 ILogger]: Interpolant automaton has 180 states. [2019-05-23 10:14:19,457 INFO L146 ILogger]: Start isEmpty. Operand 363 states and 363 transitions. [2019-05-23 10:14:19,457 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 363 [2019-05-23 10:14:19,458 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:19,458 INFO L146 ILogger]: trace histogram [178, 178, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:19,458 INFO L146 ILogger]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:19,458 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:19,458 INFO L146 ILogger]: Analyzing trace with hash -978208031, now seen corresponding path program 178 times [2019-05-23 10:14:19,458 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:19,482 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:19,486 INFO L146 ILogger]: Trace formula consists of 564 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 10:14:19,488 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:29,679 INFO L146 ILogger]: Checked inductivity of 31684 backedges. 0 proven. 31684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:29,679 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:29,679 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2019-05-23 10:14:29,679 INFO L146 ILogger]: Interpolant automaton has 181 states [2019-05-23 10:14:29,681 INFO L146 ILogger]: Constructing interpolant automaton starting with 181 interpolants. [2019-05-23 10:14:29,681 INFO L146 ILogger]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 10:14:29,681 INFO L146 ILogger]: Start difference. First operand 363 states and 363 transitions. Second operand 181 states. [2019-05-23 10:14:30,389 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:30,390 INFO L146 ILogger]: Finished difference Result 366 states and 366 transitions. [2019-05-23 10:14:30,390 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-05-23 10:14:30,390 INFO L146 ILogger]: Start accepts. Automaton has 181 states. Word has length 362 [2019-05-23 10:14:30,390 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:30,391 INFO L146 ILogger]: With dead ends: 366 [2019-05-23 10:14:30,391 INFO L146 ILogger]: Without dead ends: 366 [2019-05-23 10:14:30,392 INFO L146 ILogger]: 0 DeclaredPredicates, 361 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 10:14:30,393 INFO L146 ILogger]: Start minimizeSevpa. Operand 366 states. [2019-05-23 10:14:30,395 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-05-23 10:14:30,395 INFO L146 ILogger]: Start removeUnreachable. Operand 365 states. [2019-05-23 10:14:30,395 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-05-23 10:14:30,395 INFO L146 ILogger]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 362 [2019-05-23 10:14:30,395 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:30,395 INFO L146 ILogger]: Abstraction has 365 states and 365 transitions. [2019-05-23 10:14:30,396 INFO L146 ILogger]: Interpolant automaton has 181 states. [2019-05-23 10:14:30,396 INFO L146 ILogger]: Start isEmpty. Operand 365 states and 365 transitions. [2019-05-23 10:14:30,397 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 365 [2019-05-23 10:14:30,397 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:30,397 INFO L146 ILogger]: trace histogram [179, 179, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:30,397 INFO L146 ILogger]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:30,397 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:30,397 INFO L146 ILogger]: Analyzing trace with hash -379044225, now seen corresponding path program 179 times [2019-05-23 10:14:30,397 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:30,422 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:30,426 INFO L146 ILogger]: Trace formula consists of 567 conjuncts, 181 conjunts are in the unsatisfiable core [2019-05-23 10:14:30,427 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:40,784 INFO L146 ILogger]: Checked inductivity of 32041 backedges. 0 proven. 32041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:40,784 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:40,784 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2019-05-23 10:14:40,785 INFO L146 ILogger]: Interpolant automaton has 182 states [2019-05-23 10:14:40,786 INFO L146 ILogger]: Constructing interpolant automaton starting with 182 interpolants. [2019-05-23 10:14:40,787 INFO L146 ILogger]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-05-23 10:14:40,787 INFO L146 ILogger]: Start difference. First operand 365 states and 365 transitions. Second operand 182 states. [2019-05-23 10:14:41,495 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:41,496 INFO L146 ILogger]: Finished difference Result 368 states and 368 transitions. [2019-05-23 10:14:41,496 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2019-05-23 10:14:41,496 INFO L146 ILogger]: Start accepts. Automaton has 182 states. Word has length 364 [2019-05-23 10:14:41,497 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:41,497 INFO L146 ILogger]: With dead ends: 368 [2019-05-23 10:14:41,497 INFO L146 ILogger]: Without dead ends: 368 [2019-05-23 10:14:41,499 INFO L146 ILogger]: 0 DeclaredPredicates, 363 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-05-23 10:14:41,499 INFO L146 ILogger]: Start minimizeSevpa. Operand 368 states. [2019-05-23 10:14:41,501 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 368 to 367. [2019-05-23 10:14:41,501 INFO L146 ILogger]: Start removeUnreachable. Operand 367 states. [2019-05-23 10:14:41,501 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2019-05-23 10:14:41,501 INFO L146 ILogger]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 364 [2019-05-23 10:14:41,502 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:41,502 INFO L146 ILogger]: Abstraction has 367 states and 367 transitions. [2019-05-23 10:14:41,502 INFO L146 ILogger]: Interpolant automaton has 182 states. [2019-05-23 10:14:41,502 INFO L146 ILogger]: Start isEmpty. Operand 367 states and 367 transitions. [2019-05-23 10:14:41,503 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 367 [2019-05-23 10:14:41,503 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:41,503 INFO L146 ILogger]: trace histogram [180, 180, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:41,503 INFO L146 ILogger]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:41,503 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:41,503 INFO L146 ILogger]: Analyzing trace with hash -108244323, now seen corresponding path program 180 times [2019-05-23 10:14:41,504 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:41,527 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:41,531 INFO L146 ILogger]: Trace formula consists of 570 conjuncts, 182 conjunts are in the unsatisfiable core [2019-05-23 10:14:41,532 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:14:51,898 INFO L146 ILogger]: Checked inductivity of 32400 backedges. 0 proven. 32400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:14:51,898 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:14:51,898 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2019-05-23 10:14:51,899 INFO L146 ILogger]: Interpolant automaton has 183 states [2019-05-23 10:14:51,900 INFO L146 ILogger]: Constructing interpolant automaton starting with 183 interpolants. [2019-05-23 10:14:51,901 INFO L146 ILogger]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 10:14:51,901 INFO L146 ILogger]: Start difference. First operand 367 states and 367 transitions. Second operand 183 states. [2019-05-23 10:14:52,612 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:14:52,612 INFO L146 ILogger]: Finished difference Result 370 states and 370 transitions. [2019-05-23 10:14:52,613 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-05-23 10:14:52,613 INFO L146 ILogger]: Start accepts. Automaton has 183 states. Word has length 366 [2019-05-23 10:14:52,613 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:14:52,614 INFO L146 ILogger]: With dead ends: 370 [2019-05-23 10:14:52,614 INFO L146 ILogger]: Without dead ends: 370 [2019-05-23 10:14:52,616 INFO L146 ILogger]: 0 DeclaredPredicates, 365 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 10:14:52,616 INFO L146 ILogger]: Start minimizeSevpa. Operand 370 states. [2019-05-23 10:14:52,618 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-05-23 10:14:52,618 INFO L146 ILogger]: Start removeUnreachable. Operand 369 states. [2019-05-23 10:14:52,619 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-05-23 10:14:52,619 INFO L146 ILogger]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 366 [2019-05-23 10:14:52,619 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:14:52,619 INFO L146 ILogger]: Abstraction has 369 states and 369 transitions. [2019-05-23 10:14:52,619 INFO L146 ILogger]: Interpolant automaton has 183 states. [2019-05-23 10:14:52,619 INFO L146 ILogger]: Start isEmpty. Operand 369 states and 369 transitions. [2019-05-23 10:14:52,620 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 369 [2019-05-23 10:14:52,620 INFO L146 ILogger]: Found error trace [2019-05-23 10:14:52,620 INFO L146 ILogger]: trace histogram [181, 181, 1, 1, 1, 1, 1, 1] [2019-05-23 10:14:52,620 INFO L146 ILogger]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:14:52,620 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:14:52,620 INFO L146 ILogger]: Analyzing trace with hash -1862543557, now seen corresponding path program 181 times [2019-05-23 10:14:52,621 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:14:52,645 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:14:52,649 INFO L146 ILogger]: Trace formula consists of 573 conjuncts, 183 conjunts are in the unsatisfiable core [2019-05-23 10:14:52,650 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:15:03,249 INFO L146 ILogger]: Checked inductivity of 32761 backedges. 0 proven. 32761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:15:03,250 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:15:03,250 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2019-05-23 10:15:03,250 INFO L146 ILogger]: Interpolant automaton has 184 states [2019-05-23 10:15:03,251 INFO L146 ILogger]: Constructing interpolant automaton starting with 184 interpolants. [2019-05-23 10:15:03,252 INFO L146 ILogger]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-05-23 10:15:03,252 INFO L146 ILogger]: Start difference. First operand 369 states and 369 transitions. Second operand 184 states. [2019-05-23 10:15:03,944 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:15:03,945 INFO L146 ILogger]: Finished difference Result 372 states and 372 transitions. [2019-05-23 10:15:03,945 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-05-23 10:15:03,945 INFO L146 ILogger]: Start accepts. Automaton has 184 states. Word has length 368 [2019-05-23 10:15:03,946 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:15:03,946 INFO L146 ILogger]: With dead ends: 372 [2019-05-23 10:15:03,946 INFO L146 ILogger]: Without dead ends: 372 [2019-05-23 10:15:03,947 INFO L146 ILogger]: 0 DeclaredPredicates, 367 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-05-23 10:15:03,947 INFO L146 ILogger]: Start minimizeSevpa. Operand 372 states. [2019-05-23 10:15:03,949 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 372 to 371. [2019-05-23 10:15:03,950 INFO L146 ILogger]: Start removeUnreachable. Operand 371 states. [2019-05-23 10:15:03,950 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-05-23 10:15:03,950 INFO L146 ILogger]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 368 [2019-05-23 10:15:03,950 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:15:03,951 INFO L146 ILogger]: Abstraction has 371 states and 371 transitions. [2019-05-23 10:15:03,951 INFO L146 ILogger]: Interpolant automaton has 184 states. [2019-05-23 10:15:03,951 INFO L146 ILogger]: Start isEmpty. Operand 371 states and 371 transitions. [2019-05-23 10:15:03,952 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 371 [2019-05-23 10:15:03,952 INFO L146 ILogger]: Found error trace [2019-05-23 10:15:03,952 INFO L146 ILogger]: trace histogram [182, 182, 1, 1, 1, 1, 1, 1] [2019-05-23 10:15:03,952 INFO L146 ILogger]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:15:03,952 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:15:03,952 INFO L146 ILogger]: Analyzing trace with hash 178039897, now seen corresponding path program 182 times [2019-05-23 10:15:03,953 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:15:03,976 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:15:03,980 INFO L146 ILogger]: Trace formula consists of 576 conjuncts, 184 conjunts are in the unsatisfiable core [2019-05-23 10:15:03,982 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:15:14,657 INFO L146 ILogger]: Checked inductivity of 33124 backedges. 0 proven. 33124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:15:14,658 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:15:14,658 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2019-05-23 10:15:14,658 INFO L146 ILogger]: Interpolant automaton has 185 states [2019-05-23 10:15:14,659 INFO L146 ILogger]: Constructing interpolant automaton starting with 185 interpolants. [2019-05-23 10:15:14,660 INFO L146 ILogger]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2019-05-23 10:15:14,660 INFO L146 ILogger]: Start difference. First operand 371 states and 371 transitions. Second operand 185 states. [2019-05-23 10:15:15,404 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:15:15,404 INFO L146 ILogger]: Finished difference Result 374 states and 374 transitions. [2019-05-23 10:15:15,404 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-05-23 10:15:15,404 INFO L146 ILogger]: Start accepts. Automaton has 185 states. Word has length 370 [2019-05-23 10:15:15,405 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:15:15,405 INFO L146 ILogger]: With dead ends: 374 [2019-05-23 10:15:15,405 INFO L146 ILogger]: Without dead ends: 374 [2019-05-23 10:15:15,406 INFO L146 ILogger]: 0 DeclaredPredicates, 369 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2019-05-23 10:15:15,406 INFO L146 ILogger]: Start minimizeSevpa. Operand 374 states. [2019-05-23 10:15:15,408 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-05-23 10:15:15,408 INFO L146 ILogger]: Start removeUnreachable. Operand 373 states. [2019-05-23 10:15:15,408 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-05-23 10:15:15,408 INFO L146 ILogger]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 370 [2019-05-23 10:15:15,408 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:15:15,408 INFO L146 ILogger]: Abstraction has 373 states and 373 transitions. [2019-05-23 10:15:15,408 INFO L146 ILogger]: Interpolant automaton has 185 states. [2019-05-23 10:15:15,409 INFO L146 ILogger]: Start isEmpty. Operand 373 states and 373 transitions. [2019-05-23 10:15:15,409 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 373 [2019-05-23 10:15:15,410 INFO L146 ILogger]: Found error trace [2019-05-23 10:15:15,410 INFO L146 ILogger]: trace histogram [183, 183, 1, 1, 1, 1, 1, 1] [2019-05-23 10:15:15,410 INFO L146 ILogger]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:15:15,410 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:15:15,410 INFO L146 ILogger]: Analyzing trace with hash -1621315081, now seen corresponding path program 183 times [2019-05-23 10:15:15,410 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:15:15,434 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:15:15,438 INFO L146 ILogger]: Trace formula consists of 579 conjuncts, 185 conjunts are in the unsatisfiable core [2019-05-23 10:15:15,440 INFO L146 ILogger]: Computing forward predicates...