java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__strchr_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:44:30,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:44:30,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:44:30,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:44:30,996 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:44:30,997 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:44:30,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:44:31,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:44:31,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:44:31,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:44:31,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:44:31,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:44:31,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:44:31,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:44:31,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:44:31,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:44:31,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:44:31,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:44:31,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:44:31,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:44:31,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:44:31,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:44:31,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:44:31,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:44:31,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:44:31,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:44:31,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:44:31,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:44:31,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:44:31,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:44:31,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:44:31,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:44:31,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:44:31,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:44:31,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:44:31,043 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:44:31,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:44:31,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:44:31,068 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:44:31,068 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:44:31,069 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:44:31,069 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:44:31,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:44:31,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:44:31,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:44:31,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:44:31,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:31,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:44:31,070 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:44:31,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:44:31,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:44:31,071 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:44:31,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:44:31,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:44:31,072 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:44:31,075 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:44:31,076 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:44:31,129 INFO ]: Repository-Root is: /tmp [2018-06-22 11:44:31,149 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:44:31,155 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:44:31,157 INFO ]: Initializing SmtParser... [2018-06-22 11:44:31,157 INFO ]: SmtParser initialized [2018-06-22 11:44:31,159 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strchr_1.array.smt2 [2018-06-22 11:44:31,160 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:44:31,251 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strchr_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7ddbe7cb [2018-06-22 11:44:31,839 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strchr_1.array.smt2 [2018-06-22 11:44:31,846 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:44:31,853 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:44:31,854 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:44:31,854 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:44:31,854 INFO ]: ChcToBoogie initialized [2018-06-22 11:44:31,857 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,912 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31 Unit [2018-06-22 11:44:31,912 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:44:31,912 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:44:31,912 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:44:31,912 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:44:31,929 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,929 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,939 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,939 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,950 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,957 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,960 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... [2018-06-22 11:44:31,963 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:44:31,963 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:44:31,963 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:44:31,963 INFO ]: RCFGBuilder initialized [2018-06-22 11:44:31,971 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:44:31,984 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:44:31,984 INFO ]: Found specification of procedure False [2018-06-22 11:44:31,984 INFO ]: Found implementation of procedure False [2018-06-22 11:44:31,984 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:44:31,984 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:44:31,984 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:44:31,984 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:44:31,984 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:44:31,984 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:44:33,216 INFO ]: Using library mode [2018-06-22 11:44:33,216 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:33 BoogieIcfgContainer [2018-06-22 11:44:33,216 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:44:33,218 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:44:33,218 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:44:33,221 INFO ]: TraceAbstraction initialized [2018-06-22 11:44:33,221 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:44:31" (1/3) ... [2018-06-22 11:44:33,222 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65873160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:44:33, skipping insertion in model container [2018-06-22 11:44:33,222 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:44:31" (2/3) ... [2018-06-22 11:44:33,222 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65873160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:44:33, skipping insertion in model container [2018-06-22 11:44:33,222 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:44:33" (3/3) ... [2018-06-22 11:44:33,224 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:44:33,233 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:44:33,242 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:44:33,282 INFO ]: Using default assertion order modulation [2018-06-22 11:44:33,282 INFO ]: Interprodecural is true [2018-06-22 11:44:33,282 INFO ]: Hoare is false [2018-06-22 11:44:33,282 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:44:33,282 INFO ]: Backedges is TWOTRACK [2018-06-22 11:44:33,282 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:44:33,282 INFO ]: Difference is false [2018-06-22 11:44:33,282 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:44:33,282 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:44:33,299 INFO ]: Start isEmpty. Operand 77 states. [2018-06-22 11:44:33,330 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:33,330 INFO ]: Found error trace [2018-06-22 11:44:33,331 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:33,331 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:33,335 INFO ]: Analyzing trace with hash 645744874, now seen corresponding path program 1 times [2018-06-22 11:44:33,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:33,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:33,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:33,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:33,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:33,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:33,672 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:33,675 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:33,675 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:33,677 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:33,692 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:33,692 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:33,695 INFO ]: Start difference. First operand 77 states. Second operand 4 states. [2018-06-22 11:44:35,002 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:35,003 INFO ]: Finished difference Result 64 states and 206 transitions. [2018-06-22 11:44:35,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:35,004 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:35,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:35,016 INFO ]: With dead ends: 64 [2018-06-22 11:44:35,016 INFO ]: Without dead ends: 64 [2018-06-22 11:44:35,017 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:35,033 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:44:35,096 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-06-22 11:44:35,097 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:44:35,100 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 204 transitions. [2018-06-22 11:44:35,101 INFO ]: Start accepts. Automaton has 62 states and 204 transitions. Word has length 9 [2018-06-22 11:44:35,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:35,102 INFO ]: Abstraction has 62 states and 204 transitions. [2018-06-22 11:44:35,102 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:35,102 INFO ]: Start isEmpty. Operand 62 states and 204 transitions. [2018-06-22 11:44:35,109 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:35,109 INFO ]: Found error trace [2018-06-22 11:44:35,109 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:35,109 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:35,110 INFO ]: Analyzing trace with hash 1491195880, now seen corresponding path program 1 times [2018-06-22 11:44:35,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:35,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:35,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:35,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:35,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:35,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:35,236 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:35,236 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:35,236 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:35,238 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:35,238 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:35,238 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:35,238 INFO ]: Start difference. First operand 62 states and 204 transitions. Second operand 4 states. [2018-06-22 11:44:35,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:35,772 INFO ]: Finished difference Result 64 states and 198 transitions. [2018-06-22 11:44:35,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:35,778 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:35,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:35,780 INFO ]: With dead ends: 64 [2018-06-22 11:44:35,780 INFO ]: Without dead ends: 64 [2018-06-22 11:44:35,781 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:35,781 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:44:35,803 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-06-22 11:44:35,803 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:44:35,805 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 196 transitions. [2018-06-22 11:44:35,805 INFO ]: Start accepts. Automaton has 62 states and 196 transitions. Word has length 9 [2018-06-22 11:44:35,805 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:35,806 INFO ]: Abstraction has 62 states and 196 transitions. [2018-06-22 11:44:35,806 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:35,806 INFO ]: Start isEmpty. Operand 62 states and 196 transitions. [2018-06-22 11:44:35,809 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:35,809 INFO ]: Found error trace [2018-06-22 11:44:35,809 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:35,809 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:35,809 INFO ]: Analyzing trace with hash -1750038395, now seen corresponding path program 1 times [2018-06-22 11:44:35,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:35,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:35,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:35,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:35,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:35,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:35,861 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:35,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:35,861 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:35,862 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:35,862 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:35,862 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:35,862 INFO ]: Start difference. First operand 62 states and 196 transitions. Second operand 4 states. [2018-06-22 11:44:36,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:36,166 INFO ]: Finished difference Result 62 states and 178 transitions. [2018-06-22 11:44:36,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:36,167 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:36,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:36,169 INFO ]: With dead ends: 62 [2018-06-22 11:44:36,169 INFO ]: Without dead ends: 53 [2018-06-22 11:44:36,169 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,170 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:44:36,181 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-22 11:44:36,181 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:44:36,183 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 160 transitions. [2018-06-22 11:44:36,183 INFO ]: Start accepts. Automaton has 53 states and 160 transitions. Word has length 9 [2018-06-22 11:44:36,183 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:36,183 INFO ]: Abstraction has 53 states and 160 transitions. [2018-06-22 11:44:36,183 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:36,183 INFO ]: Start isEmpty. Operand 53 states and 160 transitions. [2018-06-22 11:44:36,185 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:36,185 INFO ]: Found error trace [2018-06-22 11:44:36,185 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:36,185 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:36,185 INFO ]: Analyzing trace with hash -1984998814, now seen corresponding path program 1 times [2018-06-22 11:44:36,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:36,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:36,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:36,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:36,250 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:36,250 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:36,250 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:36,251 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:36,251 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:36,251 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,251 INFO ]: Start difference. First operand 53 states and 160 transitions. Second operand 4 states. [2018-06-22 11:44:36,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:36,466 INFO ]: Finished difference Result 55 states and 151 transitions. [2018-06-22 11:44:36,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:36,467 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:36,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:36,469 INFO ]: With dead ends: 55 [2018-06-22 11:44:36,469 INFO ]: Without dead ends: 55 [2018-06-22 11:44:36,469 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,469 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:36,487 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-06-22 11:44:36,487 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:44:36,488 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 149 transitions. [2018-06-22 11:44:36,488 INFO ]: Start accepts. Automaton has 53 states and 149 transitions. Word has length 9 [2018-06-22 11:44:36,488 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:36,488 INFO ]: Abstraction has 53 states and 149 transitions. [2018-06-22 11:44:36,488 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:36,488 INFO ]: Start isEmpty. Operand 53 states and 149 transitions. [2018-06-22 11:44:36,494 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:36,494 INFO ]: Found error trace [2018-06-22 11:44:36,494 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:36,494 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:36,494 INFO ]: Analyzing trace with hash 2048329659, now seen corresponding path program 1 times [2018-06-22 11:44:36,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:36,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:36,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:36,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,504 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:36,612 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:36,612 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:36,612 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:36,612 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:36,612 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:36,612 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,612 INFO ]: Start difference. First operand 53 states and 149 transitions. Second operand 4 states. [2018-06-22 11:44:36,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:36,868 INFO ]: Finished difference Result 55 states and 150 transitions. [2018-06-22 11:44:36,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:36,870 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:36,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:36,871 INFO ]: With dead ends: 55 [2018-06-22 11:44:36,871 INFO ]: Without dead ends: 55 [2018-06-22 11:44:36,872 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,872 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:36,888 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-06-22 11:44:36,888 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:44:36,889 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 148 transitions. [2018-06-22 11:44:36,889 INFO ]: Start accepts. Automaton has 53 states and 148 transitions. Word has length 9 [2018-06-22 11:44:36,889 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:36,889 INFO ]: Abstraction has 53 states and 148 transitions. [2018-06-22 11:44:36,889 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:36,889 INFO ]: Start isEmpty. Operand 53 states and 148 transitions. [2018-06-22 11:44:36,893 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:36,893 INFO ]: Found error trace [2018-06-22 11:44:36,893 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:36,893 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:36,893 INFO ]: Analyzing trace with hash -320775206, now seen corresponding path program 1 times [2018-06-22 11:44:36,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:36,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:36,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:36,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:36,898 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:36,928 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:36,928 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:36,928 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:36,928 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:36,928 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:36,928 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:36,928 INFO ]: Start difference. First operand 53 states and 148 transitions. Second operand 4 states. [2018-06-22 11:44:37,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:37,066 INFO ]: Finished difference Result 55 states and 146 transitions. [2018-06-22 11:44:37,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:37,067 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:37,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:37,068 INFO ]: With dead ends: 55 [2018-06-22 11:44:37,068 INFO ]: Without dead ends: 55 [2018-06-22 11:44:37,069 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,069 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:37,077 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-06-22 11:44:37,077 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:44:37,078 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 144 transitions. [2018-06-22 11:44:37,078 INFO ]: Start accepts. Automaton has 53 states and 144 transitions. Word has length 9 [2018-06-22 11:44:37,078 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:37,078 INFO ]: Abstraction has 53 states and 144 transitions. [2018-06-22 11:44:37,078 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:37,078 INFO ]: Start isEmpty. Operand 53 states and 144 transitions. [2018-06-22 11:44:37,079 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:37,079 INFO ]: Found error trace [2018-06-22 11:44:37,080 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:37,080 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:37,080 INFO ]: Analyzing trace with hash 732957815, now seen corresponding path program 1 times [2018-06-22 11:44:37,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:37,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:37,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:37,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:37,112 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:37,112 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:37,112 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:37,113 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:37,113 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:37,113 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,113 INFO ]: Start difference. First operand 53 states and 144 transitions. Second operand 4 states. [2018-06-22 11:44:37,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:37,223 INFO ]: Finished difference Result 55 states and 144 transitions. [2018-06-22 11:44:37,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:37,224 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:37,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:37,225 INFO ]: With dead ends: 55 [2018-06-22 11:44:37,225 INFO ]: Without dead ends: 55 [2018-06-22 11:44:37,225 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,225 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:37,233 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-06-22 11:44:37,233 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:44:37,234 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 142 transitions. [2018-06-22 11:44:37,234 INFO ]: Start accepts. Automaton has 53 states and 142 transitions. Word has length 9 [2018-06-22 11:44:37,234 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:37,234 INFO ]: Abstraction has 53 states and 142 transitions. [2018-06-22 11:44:37,234 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:37,234 INFO ]: Start isEmpty. Operand 53 states and 142 transitions. [2018-06-22 11:44:37,235 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:37,235 INFO ]: Found error trace [2018-06-22 11:44:37,235 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:37,236 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:37,236 INFO ]: Analyzing trace with hash -582414029, now seen corresponding path program 1 times [2018-06-22 11:44:37,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:37,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:37,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:37,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,240 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:37,255 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:37,255 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:37,255 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:37,256 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:37,256 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:37,256 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,256 INFO ]: Start difference. First operand 53 states and 142 transitions. Second operand 4 states. [2018-06-22 11:44:37,444 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:37,444 INFO ]: Finished difference Result 53 states and 136 transitions. [2018-06-22 11:44:37,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:37,495 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:37,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:37,496 INFO ]: With dead ends: 53 [2018-06-22 11:44:37,496 INFO ]: Without dead ends: 50 [2018-06-22 11:44:37,496 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,496 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:44:37,503 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 11:44:37,503 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:44:37,504 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 130 transitions. [2018-06-22 11:44:37,504 INFO ]: Start accepts. Automaton has 50 states and 130 transitions. Word has length 9 [2018-06-22 11:44:37,504 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:37,504 INFO ]: Abstraction has 50 states and 130 transitions. [2018-06-22 11:44:37,504 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:37,504 INFO ]: Start isEmpty. Operand 50 states and 130 transitions. [2018-06-22 11:44:37,506 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:37,506 INFO ]: Found error trace [2018-06-22 11:44:37,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:37,506 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:37,506 INFO ]: Analyzing trace with hash 1398154, now seen corresponding path program 1 times [2018-06-22 11:44:37,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:37,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:37,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:37,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,511 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:37,543 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:37,543 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:37,543 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:37,543 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:37,543 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:37,543 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,543 INFO ]: Start difference. First operand 50 states and 130 transitions. Second operand 4 states. [2018-06-22 11:44:37,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:37,838 INFO ]: Finished difference Result 52 states and 131 transitions. [2018-06-22 11:44:37,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:37,838 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:37,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:37,839 INFO ]: With dead ends: 52 [2018-06-22 11:44:37,839 INFO ]: Without dead ends: 52 [2018-06-22 11:44:37,840 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,840 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:44:37,847 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 11:44:37,847 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:44:37,848 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 129 transitions. [2018-06-22 11:44:37,848 INFO ]: Start accepts. Automaton has 50 states and 129 transitions. Word has length 9 [2018-06-22 11:44:37,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:37,848 INFO ]: Abstraction has 50 states and 129 transitions. [2018-06-22 11:44:37,848 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:37,848 INFO ]: Start isEmpty. Operand 50 states and 129 transitions. [2018-06-22 11:44:37,849 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:37,849 INFO ]: Found error trace [2018-06-22 11:44:37,849 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:37,849 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:37,849 INFO ]: Analyzing trace with hash 585210337, now seen corresponding path program 1 times [2018-06-22 11:44:37,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:37,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:37,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:37,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:37,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:37,964 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:37,964 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:37,964 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:37,964 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:37,964 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:37,964 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:37,964 INFO ]: Start difference. First operand 50 states and 129 transitions. Second operand 4 states. [2018-06-22 11:44:38,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:38,079 INFO ]: Finished difference Result 52 states and 130 transitions. [2018-06-22 11:44:38,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:38,080 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:38,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:38,081 INFO ]: With dead ends: 52 [2018-06-22 11:44:38,081 INFO ]: Without dead ends: 52 [2018-06-22 11:44:38,081 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:38,081 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:44:38,089 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 11:44:38,090 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:44:38,090 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 128 transitions. [2018-06-22 11:44:38,090 INFO ]: Start accepts. Automaton has 50 states and 128 transitions. Word has length 9 [2018-06-22 11:44:38,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:38,091 INFO ]: Abstraction has 50 states and 128 transitions. [2018-06-22 11:44:38,091 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:38,091 INFO ]: Start isEmpty. Operand 50 states and 128 transitions. [2018-06-22 11:44:38,092 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:44:38,092 INFO ]: Found error trace [2018-06-22 11:44:38,092 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:38,092 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:38,092 INFO ]: Analyzing trace with hash 323571514, now seen corresponding path program 1 times [2018-06-22 11:44:38,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:38,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:38,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:38,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:38,126 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:44:38,127 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:38,127 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:44:38,127 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:44:38,127 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:44:38,127 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:38,127 INFO ]: Start difference. First operand 50 states and 128 transitions. Second operand 4 states. [2018-06-22 11:44:38,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:38,297 INFO ]: Finished difference Result 52 states and 129 transitions. [2018-06-22 11:44:38,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:44:38,297 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:44:38,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:38,298 INFO ]: With dead ends: 52 [2018-06-22 11:44:38,298 INFO ]: Without dead ends: 52 [2018-06-22 11:44:38,298 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:44:38,298 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:44:38,304 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-06-22 11:44:38,304 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:44:38,305 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 127 transitions. [2018-06-22 11:44:38,305 INFO ]: Start accepts. Automaton has 50 states and 127 transitions. Word has length 9 [2018-06-22 11:44:38,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:38,305 INFO ]: Abstraction has 50 states and 127 transitions. [2018-06-22 11:44:38,305 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:44:38,305 INFO ]: Start isEmpty. Operand 50 states and 127 transitions. [2018-06-22 11:44:38,307 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:38,307 INFO ]: Found error trace [2018-06-22 11:44:38,307 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:38,307 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:38,307 INFO ]: Analyzing trace with hash -1260041119, now seen corresponding path program 1 times [2018-06-22 11:44:38,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:38,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:38,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:38,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:38,319 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:38,442 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:38,442 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:38,442 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:38,442 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:38,442 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:38,442 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:38,442 INFO ]: Start difference. First operand 50 states and 127 transitions. Second operand 5 states. [2018-06-22 11:44:39,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:39,091 INFO ]: Finished difference Result 56 states and 207 transitions. [2018-06-22 11:44:39,092 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:39,092 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:39,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:39,093 INFO ]: With dead ends: 56 [2018-06-22 11:44:39,093 INFO ]: Without dead ends: 56 [2018-06-22 11:44:39,093 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:39,093 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:39,115 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:39,115 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:39,116 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 165 transitions. [2018-06-22 11:44:39,116 INFO ]: Start accepts. Automaton has 52 states and 165 transitions. Word has length 13 [2018-06-22 11:44:39,116 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:39,116 INFO ]: Abstraction has 52 states and 165 transitions. [2018-06-22 11:44:39,116 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:39,116 INFO ]: Start isEmpty. Operand 52 states and 165 transitions. [2018-06-22 11:44:39,118 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:39,118 INFO ]: Found error trace [2018-06-22 11:44:39,118 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:39,118 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:39,118 INFO ]: Analyzing trace with hash 666972298, now seen corresponding path program 1 times [2018-06-22 11:44:39,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:39,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:39,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:39,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:39,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:39,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:39,198 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:39,198 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:39,198 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:39,198 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:39,198 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:39,198 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:39,198 INFO ]: Start difference. First operand 52 states and 165 transitions. Second operand 5 states. [2018-06-22 11:44:39,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:39,697 INFO ]: Finished difference Result 56 states and 199 transitions. [2018-06-22 11:44:39,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:39,697 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:39,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:39,698 INFO ]: With dead ends: 56 [2018-06-22 11:44:39,698 INFO ]: Without dead ends: 56 [2018-06-22 11:44:39,698 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:39,698 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:39,709 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:39,710 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:39,710 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 157 transitions. [2018-06-22 11:44:39,710 INFO ]: Start accepts. Automaton has 52 states and 157 transitions. Word has length 13 [2018-06-22 11:44:39,710 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:39,710 INFO ]: Abstraction has 52 states and 157 transitions. [2018-06-22 11:44:39,710 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:39,710 INFO ]: Start isEmpty. Operand 52 states and 157 transitions. [2018-06-22 11:44:39,712 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:39,712 INFO ]: Found error trace [2018-06-22 11:44:39,712 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:39,712 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:39,712 INFO ]: Analyzing trace with hash -168857395, now seen corresponding path program 1 times [2018-06-22 11:44:39,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:39,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:39,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:39,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:39,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:39,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:39,785 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:39,785 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:39,785 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:39,786 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:39,786 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:39,786 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:39,786 INFO ]: Start difference. First operand 52 states and 157 transitions. Second operand 5 states. [2018-06-22 11:44:40,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,196 INFO ]: Finished difference Result 56 states and 195 transitions. [2018-06-22 11:44:40,196 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:40,196 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:40,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,197 INFO ]: With dead ends: 56 [2018-06-22 11:44:40,197 INFO ]: Without dead ends: 56 [2018-06-22 11:44:40,197 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:40,197 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:40,206 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:40,206 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:40,208 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 153 transitions. [2018-06-22 11:44:40,208 INFO ]: Start accepts. Automaton has 52 states and 153 transitions. Word has length 13 [2018-06-22 11:44:40,208 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,208 INFO ]: Abstraction has 52 states and 153 transitions. [2018-06-22 11:44:40,208 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:40,208 INFO ]: Start isEmpty. Operand 52 states and 153 transitions. [2018-06-22 11:44:40,209 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,209 INFO ]: Found error trace [2018-06-22 11:44:40,209 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,210 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,210 INFO ]: Analyzing trace with hash 1107912760, now seen corresponding path program 1 times [2018-06-22 11:44:40,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:40,338 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:40,338 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:40,338 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:40,338 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:40,338 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:40,338 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:40,338 INFO ]: Start difference. First operand 52 states and 153 transitions. Second operand 5 states. [2018-06-22 11:44:40,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,588 INFO ]: Finished difference Result 56 states and 188 transitions. [2018-06-22 11:44:40,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:40,588 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:40,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,589 INFO ]: With dead ends: 56 [2018-06-22 11:44:40,589 INFO ]: Without dead ends: 56 [2018-06-22 11:44:40,589 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:40,589 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:40,596 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:40,596 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:40,596 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 146 transitions. [2018-06-22 11:44:40,596 INFO ]: Start accepts. Automaton has 52 states and 146 transitions. Word has length 13 [2018-06-22 11:44:40,597 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,597 INFO ]: Abstraction has 52 states and 146 transitions. [2018-06-22 11:44:40,597 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:40,597 INFO ]: Start isEmpty. Operand 52 states and 146 transitions. [2018-06-22 11:44:40,598 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,598 INFO ]: Found error trace [2018-06-22 11:44:40,598 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,598 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,598 INFO ]: Analyzing trace with hash 1502801991, now seen corresponding path program 1 times [2018-06-22 11:44:40,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,605 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:40,655 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:40,655 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:40,655 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:40,655 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:40,655 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:40,655 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:40,656 INFO ]: Start difference. First operand 52 states and 146 transitions. Second operand 5 states. [2018-06-22 11:44:40,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:40,938 INFO ]: Finished difference Result 56 states and 183 transitions. [2018-06-22 11:44:40,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:40,938 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:40,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:40,939 INFO ]: With dead ends: 56 [2018-06-22 11:44:40,939 INFO ]: Without dead ends: 56 [2018-06-22 11:44:40,939 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:40,939 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:40,947 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:40,947 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:40,948 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 141 transitions. [2018-06-22 11:44:40,948 INFO ]: Start accepts. Automaton has 52 states and 141 transitions. Word has length 13 [2018-06-22 11:44:40,948 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:40,948 INFO ]: Abstraction has 52 states and 141 transitions. [2018-06-22 11:44:40,948 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:40,948 INFO ]: Start isEmpty. Operand 52 states and 141 transitions. [2018-06-22 11:44:40,949 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:40,949 INFO ]: Found error trace [2018-06-22 11:44:40,950 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:40,950 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:40,950 INFO ]: Analyzing trace with hash 16729036, now seen corresponding path program 1 times [2018-06-22 11:44:40,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:40,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:40,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,950 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:40,950 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:40,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,015 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,015 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,015 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:41,016 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:41,016 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:41,016 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,016 INFO ]: Start difference. First operand 52 states and 141 transitions. Second operand 5 states. [2018-06-22 11:44:41,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:41,251 INFO ]: Finished difference Result 56 states and 177 transitions. [2018-06-22 11:44:41,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:41,252 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:41,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:41,252 INFO ]: With dead ends: 56 [2018-06-22 11:44:41,252 INFO ]: Without dead ends: 56 [2018-06-22 11:44:41,253 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:41,253 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:41,261 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:41,261 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:41,261 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 135 transitions. [2018-06-22 11:44:41,261 INFO ]: Start accepts. Automaton has 52 states and 135 transitions. Word has length 13 [2018-06-22 11:44:41,262 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:41,262 INFO ]: Abstraction has 52 states and 135 transitions. [2018-06-22 11:44:41,262 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:41,262 INFO ]: Start isEmpty. Operand 52 states and 135 transitions. [2018-06-22 11:44:41,263 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:41,263 INFO ]: Found error trace [2018-06-22 11:44:41,263 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:41,263 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:41,263 INFO ]: Analyzing trace with hash 2129328884, now seen corresponding path program 1 times [2018-06-22 11:44:41,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:41,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:41,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,264 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:41,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,343 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,343 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,343 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:41,344 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:41,344 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:41,344 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,344 INFO ]: Start difference. First operand 52 states and 135 transitions. Second operand 5 states. [2018-06-22 11:44:41,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:41,626 INFO ]: Finished difference Result 56 states and 176 transitions. [2018-06-22 11:44:41,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:41,627 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:41,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:41,627 INFO ]: With dead ends: 56 [2018-06-22 11:44:41,627 INFO ]: Without dead ends: 56 [2018-06-22 11:44:41,627 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:41,627 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:41,633 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:41,633 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:41,633 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 134 transitions. [2018-06-22 11:44:41,633 INFO ]: Start accepts. Automaton has 52 states and 134 transitions. Word has length 13 [2018-06-22 11:44:41,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:41,634 INFO ]: Abstraction has 52 states and 134 transitions. [2018-06-22 11:44:41,634 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:41,634 INFO ]: Start isEmpty. Operand 52 states and 134 transitions. [2018-06-22 11:44:41,635 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:41,635 INFO ]: Found error trace [2018-06-22 11:44:41,635 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:41,635 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:41,635 INFO ]: Analyzing trace with hash 202315467, now seen corresponding path program 1 times [2018-06-22 11:44:41,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:41,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:41,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:41,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:41,642 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:41,722 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:41,722 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:41,722 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:41,722 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:41,722 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:41,722 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:41,722 INFO ]: Start difference. First operand 52 states and 134 transitions. Second operand 5 states. [2018-06-22 11:44:42,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:42,079 INFO ]: Finished difference Result 56 states and 175 transitions. [2018-06-22 11:44:42,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:42,079 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:42,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:42,080 INFO ]: With dead ends: 56 [2018-06-22 11:44:42,080 INFO ]: Without dead ends: 56 [2018-06-22 11:44:42,080 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:42,081 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:42,087 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:42,087 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:42,087 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 133 transitions. [2018-06-22 11:44:42,087 INFO ]: Start accepts. Automaton has 52 states and 133 transitions. Word has length 13 [2018-06-22 11:44:42,088 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:42,088 INFO ]: Abstraction has 52 states and 133 transitions. [2018-06-22 11:44:42,088 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:42,088 INFO ]: Start isEmpty. Operand 52 states and 133 transitions. [2018-06-22 11:44:42,089 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:42,089 INFO ]: Found error trace [2018-06-22 11:44:42,089 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:42,089 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:42,089 INFO ]: Analyzing trace with hash 2013510053, now seen corresponding path program 1 times [2018-06-22 11:44:42,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:42,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:42,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:42,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:42,315 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-06-22 11:44:42,340 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:42,340 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:42,340 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:42,340 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:42,340 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:42,340 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:42,341 INFO ]: Start difference. First operand 52 states and 133 transitions. Second operand 5 states. [2018-06-22 11:44:42,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:42,711 INFO ]: Finished difference Result 56 states and 174 transitions. [2018-06-22 11:44:42,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:42,712 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:42,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:42,712 INFO ]: With dead ends: 56 [2018-06-22 11:44:42,712 INFO ]: Without dead ends: 56 [2018-06-22 11:44:42,713 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:42,713 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:42,719 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-22 11:44:42,719 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:44:42,719 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 132 transitions. [2018-06-22 11:44:42,720 INFO ]: Start accepts. Automaton has 52 states and 132 transitions. Word has length 13 [2018-06-22 11:44:42,720 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:42,720 INFO ]: Abstraction has 52 states and 132 transitions. [2018-06-22 11:44:42,720 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:42,720 INFO ]: Start isEmpty. Operand 52 states and 132 transitions. [2018-06-22 11:44:42,721 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:42,721 INFO ]: Found error trace [2018-06-22 11:44:42,721 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:42,721 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:42,721 INFO ]: Analyzing trace with hash -2095870812, now seen corresponding path program 1 times [2018-06-22 11:44:42,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:42,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:42,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:42,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:42,728 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:42,837 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:44:42,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:44:42,837 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:44:42,837 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:44:42,837 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:44:42,837 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:44:42,837 INFO ]: Start difference. First operand 52 states and 132 transitions. Second operand 5 states. [2018-06-22 11:44:43,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:43,140 INFO ]: Finished difference Result 56 states and 173 transitions. [2018-06-22 11:44:43,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:43,140 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:44:43,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:43,141 INFO ]: With dead ends: 56 [2018-06-22 11:44:43,141 INFO ]: Without dead ends: 56 [2018-06-22 11:44:43,141 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:43,141 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:44:43,147 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-06-22 11:44:43,147 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:44:43,147 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 127 transitions. [2018-06-22 11:44:43,147 INFO ]: Start accepts. Automaton has 50 states and 127 transitions. Word has length 13 [2018-06-22 11:44:43,147 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:43,148 INFO ]: Abstraction has 50 states and 127 transitions. [2018-06-22 11:44:43,148 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:44:43,148 INFO ]: Start isEmpty. Operand 50 states and 127 transitions. [2018-06-22 11:44:43,148 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:43,148 INFO ]: Found error trace [2018-06-22 11:44:43,149 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:43,149 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:43,149 INFO ]: Analyzing trace with hash 862661907, now seen corresponding path program 1 times [2018-06-22 11:44:43,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:43,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:43,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:43,149 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:43,149 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:43,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:43,201 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:43,202 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:43,202 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:43,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:43,219 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:43,228 INFO ]: Computing forward predicates... [2018-06-22 11:44:43,468 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:44:43,767 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:43,790 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:43,790 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:44:43,790 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:44:43,790 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:44:43,790 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:43,790 INFO ]: Start difference. First operand 50 states and 127 transitions. Second operand 10 states. [2018-06-22 11:44:44,461 WARN ]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2018-06-22 11:44:45,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:45,465 INFO ]: Finished difference Result 60 states and 200 transitions. [2018-06-22 11:44:45,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:44:45,467 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:44:45,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:45,467 INFO ]: With dead ends: 60 [2018-06-22 11:44:45,467 INFO ]: Without dead ends: 60 [2018-06-22 11:44:45,467 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:44:45,468 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:44:45,477 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-06-22 11:44:45,477 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:44:45,477 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 156 transitions. [2018-06-22 11:44:45,477 INFO ]: Start accepts. Automaton has 54 states and 156 transitions. Word has length 13 [2018-06-22 11:44:45,477 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:45,477 INFO ]: Abstraction has 54 states and 156 transitions. [2018-06-22 11:44:45,477 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:44:45,478 INFO ]: Start isEmpty. Operand 54 states and 156 transitions. [2018-06-22 11:44:45,479 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:45,479 INFO ]: Found error trace [2018-06-22 11:44:45,479 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:45,479 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:45,479 INFO ]: Analyzing trace with hash 677075476, now seen corresponding path program 1 times [2018-06-22 11:44:45,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:45,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:45,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:45,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:45,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:45,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:45,678 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:45,678 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:45,678 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:45,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:45,707 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:45,709 INFO ]: Computing forward predicates... [2018-06-22 11:44:45,720 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:45,741 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:45,741 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:45,741 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:45,741 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:45,741 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:45,742 INFO ]: Start difference. First operand 54 states and 156 transitions. Second operand 6 states. [2018-06-22 11:44:46,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:46,096 INFO ]: Finished difference Result 60 states and 232 transitions. [2018-06-22 11:44:46,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:46,096 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:46,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:46,097 INFO ]: With dead ends: 60 [2018-06-22 11:44:46,097 INFO ]: Without dead ends: 60 [2018-06-22 11:44:46,097 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:46,097 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:44:46,113 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-06-22 11:44:46,113 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:44:46,113 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 190 transitions. [2018-06-22 11:44:46,113 INFO ]: Start accepts. Automaton has 56 states and 190 transitions. Word has length 13 [2018-06-22 11:44:46,114 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:46,114 INFO ]: Abstraction has 56 states and 190 transitions. [2018-06-22 11:44:46,114 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:46,114 INFO ]: Start isEmpty. Operand 56 states and 190 transitions. [2018-06-22 11:44:46,115 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:46,115 INFO ]: Found error trace [2018-06-22 11:44:46,115 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:46,115 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:46,115 INFO ]: Analyzing trace with hash 1443137569, now seen corresponding path program 1 times [2018-06-22 11:44:46,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:46,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:46,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:46,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:46,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:46,122 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:46,148 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:46,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:46,148 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:46,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:46,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:46,164 INFO ]: Computing forward predicates... [2018-06-22 11:44:46,180 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:46,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:46,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:46,201 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:46,201 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:46,201 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:46,201 INFO ]: Start difference. First operand 56 states and 190 transitions. Second operand 6 states. [2018-06-22 11:44:46,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:46,588 INFO ]: Finished difference Result 60 states and 212 transitions. [2018-06-22 11:44:46,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:46,588 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:46,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:46,588 INFO ]: With dead ends: 60 [2018-06-22 11:44:46,588 INFO ]: Without dead ends: 55 [2018-06-22 11:44:46,589 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:46,589 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:46,595 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:46,595 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:46,595 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 165 transitions. [2018-06-22 11:44:46,596 INFO ]: Start accepts. Automaton has 51 states and 165 transitions. Word has length 13 [2018-06-22 11:44:46,596 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:46,596 INFO ]: Abstraction has 51 states and 165 transitions. [2018-06-22 11:44:46,596 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:46,596 INFO ]: Start isEmpty. Operand 51 states and 165 transitions. [2018-06-22 11:44:46,597 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:46,597 INFO ]: Found error trace [2018-06-22 11:44:46,597 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:46,597 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:46,597 INFO ]: Analyzing trace with hash -1505291972, now seen corresponding path program 1 times [2018-06-22 11:44:46,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:46,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:46,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:46,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:46,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:46,605 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:46,745 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:46,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:46,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:46,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:46,758 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:46,760 INFO ]: Computing forward predicates... [2018-06-22 11:44:46,803 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:46,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:46,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:46,822 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:46,823 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:46,823 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:46,823 INFO ]: Start difference. First operand 51 states and 165 transitions. Second operand 7 states. [2018-06-22 11:44:47,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:47,094 INFO ]: Finished difference Result 55 states and 200 transitions. [2018-06-22 11:44:47,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:47,094 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:47,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:47,095 INFO ]: With dead ends: 55 [2018-06-22 11:44:47,095 INFO ]: Without dead ends: 55 [2018-06-22 11:44:47,095 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:47,095 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:47,101 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:47,101 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:47,102 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 163 transitions. [2018-06-22 11:44:47,102 INFO ]: Start accepts. Automaton has 51 states and 163 transitions. Word has length 13 [2018-06-22 11:44:47,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:47,102 INFO ]: Abstraction has 51 states and 163 transitions. [2018-06-22 11:44:47,102 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:47,102 INFO ]: Start isEmpty. Operand 51 states and 163 transitions. [2018-06-22 11:44:47,104 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:47,104 INFO ]: Found error trace [2018-06-22 11:44:47,104 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:47,104 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:47,104 INFO ]: Analyzing trace with hash 1814310431, now seen corresponding path program 1 times [2018-06-22 11:44:47,104 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:47,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:47,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:47,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:47,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:47,110 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:47,434 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:47,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:47,434 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:47,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:47,469 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:47,471 INFO ]: Computing forward predicates... [2018-06-22 11:44:47,722 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:47,743 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:47,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:47,743 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:47,743 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:47,743 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:47,743 INFO ]: Start difference. First operand 51 states and 163 transitions. Second operand 7 states. [2018-06-22 11:44:48,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:48,240 INFO ]: Finished difference Result 55 states and 198 transitions. [2018-06-22 11:44:48,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:48,240 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:48,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:48,241 INFO ]: With dead ends: 55 [2018-06-22 11:44:48,241 INFO ]: Without dead ends: 55 [2018-06-22 11:44:48,241 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:48,241 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:48,249 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:48,249 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:48,249 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 161 transitions. [2018-06-22 11:44:48,249 INFO ]: Start accepts. Automaton has 51 states and 161 transitions. Word has length 13 [2018-06-22 11:44:48,250 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:48,250 INFO ]: Abstraction has 51 states and 161 transitions. [2018-06-22 11:44:48,250 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:48,250 INFO ]: Start isEmpty. Operand 51 states and 161 transitions. [2018-06-22 11:44:48,251 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:48,251 INFO ]: Found error trace [2018-06-22 11:44:48,251 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:48,251 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:48,251 INFO ]: Analyzing trace with hash 1257551138, now seen corresponding path program 1 times [2018-06-22 11:44:48,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:48,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:48,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:48,255 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:48,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:48,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:48,432 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:48,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:48,432 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:48,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:48,462 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:48,464 INFO ]: Computing forward predicates... [2018-06-22 11:44:48,621 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:48,647 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:48,647 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:48,648 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:48,648 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:48,648 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:48,648 INFO ]: Start difference. First operand 51 states and 161 transitions. Second operand 7 states. [2018-06-22 11:44:49,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:49,131 INFO ]: Finished difference Result 55 states and 197 transitions. [2018-06-22 11:44:49,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:49,131 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:49,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:49,132 INFO ]: With dead ends: 55 [2018-06-22 11:44:49,132 INFO ]: Without dead ends: 55 [2018-06-22 11:44:49,132 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:49,132 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:49,137 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:49,137 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:49,138 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 160 transitions. [2018-06-22 11:44:49,138 INFO ]: Start accepts. Automaton has 51 states and 160 transitions. Word has length 13 [2018-06-22 11:44:49,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:49,138 INFO ]: Abstraction has 51 states and 160 transitions. [2018-06-22 11:44:49,138 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:49,138 INFO ]: Start isEmpty. Operand 51 states and 160 transitions. [2018-06-22 11:44:49,139 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:49,139 INFO ]: Found error trace [2018-06-22 11:44:49,139 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:49,139 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:49,140 INFO ]: Analyzing trace with hash 1698491600, now seen corresponding path program 1 times [2018-06-22 11:44:49,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:49,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:49,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:49,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:49,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:49,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:49,343 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:49,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:49,343 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:49,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:49,359 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:49,360 INFO ]: Computing forward predicates... [2018-06-22 11:44:49,371 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:49,390 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:49,390 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:49,390 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:49,390 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:49,390 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:49,390 INFO ]: Start difference. First operand 51 states and 160 transitions. Second operand 6 states. [2018-06-22 11:44:49,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:49,660 INFO ]: Finished difference Result 55 states and 189 transitions. [2018-06-22 11:44:49,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:49,660 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:49,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:49,661 INFO ]: With dead ends: 55 [2018-06-22 11:44:49,661 INFO ]: Without dead ends: 53 [2018-06-22 11:44:49,661 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:49,661 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:44:49,668 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:44:49,669 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:44:49,669 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-06-22 11:44:49,669 INFO ]: Start accepts. Automaton has 49 states and 150 transitions. Word has length 13 [2018-06-22 11:44:49,669 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:49,669 INFO ]: Abstraction has 49 states and 150 transitions. [2018-06-22 11:44:49,669 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:49,669 INFO ]: Start isEmpty. Operand 49 states and 150 transitions. [2018-06-22 11:44:49,670 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:49,670 INFO ]: Found error trace [2018-06-22 11:44:49,670 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:49,670 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:49,671 INFO ]: Analyzing trace with hash -1900181203, now seen corresponding path program 1 times [2018-06-22 11:44:49,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:49,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:49,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:49,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:49,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:49,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:50,127 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:50,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:50,127 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:50,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:50,159 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:50,160 INFO ]: Computing forward predicates... [2018-06-22 11:44:50,379 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:50,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:50,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:50,398 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:50,399 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:50,399 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:50,399 INFO ]: Start difference. First operand 49 states and 150 transitions. Second operand 7 states. [2018-06-22 11:44:50,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:50,861 INFO ]: Finished difference Result 53 states and 179 transitions. [2018-06-22 11:44:50,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:50,861 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:50,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:50,862 INFO ]: With dead ends: 53 [2018-06-22 11:44:50,862 INFO ]: Without dead ends: 53 [2018-06-22 11:44:50,862 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:50,862 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:44:50,868 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:44:50,868 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:44:50,868 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 144 transitions. [2018-06-22 11:44:50,868 INFO ]: Start accepts. Automaton has 49 states and 144 transitions. Word has length 13 [2018-06-22 11:44:50,868 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:50,868 INFO ]: Abstraction has 49 states and 144 transitions. [2018-06-22 11:44:50,868 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:50,868 INFO ]: Start isEmpty. Operand 49 states and 144 transitions. [2018-06-22 11:44:50,869 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:50,869 INFO ]: Found error trace [2018-06-22 11:44:50,869 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:50,869 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:50,870 INFO ]: Analyzing trace with hash 421721445, now seen corresponding path program 1 times [2018-06-22 11:44:50,870 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:50,870 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:50,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:50,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:50,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:50,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:50,937 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:50,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:50,937 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:50,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:50,952 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:50,953 INFO ]: Computing forward predicates... [2018-06-22 11:44:51,108 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:51,138 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:51,138 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:51,138 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:51,139 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:51,139 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:51,139 INFO ]: Start difference. First operand 49 states and 144 transitions. Second operand 7 states. [2018-06-22 11:44:51,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:51,556 INFO ]: Finished difference Result 53 states and 178 transitions. [2018-06-22 11:44:51,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:51,556 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:51,556 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:51,556 INFO ]: With dead ends: 53 [2018-06-22 11:44:51,556 INFO ]: Without dead ends: 53 [2018-06-22 11:44:51,557 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:51,557 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:44:51,561 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:44:51,561 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:44:51,562 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 143 transitions. [2018-06-22 11:44:51,562 INFO ]: Start accepts. Automaton has 49 states and 143 transitions. Word has length 13 [2018-06-22 11:44:51,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:51,562 INFO ]: Abstraction has 49 states and 143 transitions. [2018-06-22 11:44:51,562 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:51,562 INFO ]: Start isEmpty. Operand 49 states and 143 transitions. [2018-06-22 11:44:51,563 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:51,563 INFO ]: Found error trace [2018-06-22 11:44:51,563 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:51,563 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:51,563 INFO ]: Analyzing trace with hash 792894307, now seen corresponding path program 1 times [2018-06-22 11:44:51,563 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:51,563 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:51,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:51,564 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:51,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:51,566 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:51,597 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:51,597 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:51,597 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:51,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:51,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:51,611 INFO ]: Computing forward predicates... [2018-06-22 11:44:51,624 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:51,643 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:51,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:51,643 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:51,643 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:51,644 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:51,644 INFO ]: Start difference. First operand 49 states and 143 transitions. Second operand 6 states. [2018-06-22 11:44:52,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:52,350 INFO ]: Finished difference Result 51 states and 172 transitions. [2018-06-22 11:44:52,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:52,359 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:52,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:52,359 INFO ]: With dead ends: 51 [2018-06-22 11:44:52,359 INFO ]: Without dead ends: 50 [2018-06-22 11:44:52,360 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:52,360 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:44:52,365 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 11:44:52,365 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:44:52,366 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 138 transitions. [2018-06-22 11:44:52,366 INFO ]: Start accepts. Automaton has 48 states and 138 transitions. Word has length 13 [2018-06-22 11:44:52,366 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:52,366 INFO ]: Abstraction has 48 states and 138 transitions. [2018-06-22 11:44:52,366 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:52,366 INFO ]: Start isEmpty. Operand 48 states and 138 transitions. [2018-06-22 11:44:52,367 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:52,367 INFO ]: Found error trace [2018-06-22 11:44:52,367 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:52,367 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:52,367 INFO ]: Analyzing trace with hash -1760646003, now seen corresponding path program 1 times [2018-06-22 11:44:52,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:52,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:52,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:52,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:52,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:52,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:52,444 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:52,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:52,444 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:52,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:52,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:52,471 INFO ]: Computing forward predicates... [2018-06-22 11:44:52,564 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:52,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:52,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:52,585 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:52,585 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:52,585 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:52,585 INFO ]: Start difference. First operand 48 states and 138 transitions. Second operand 7 states. [2018-06-22 11:44:53,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:53,061 INFO ]: Finished difference Result 52 states and 171 transitions. [2018-06-22 11:44:53,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:53,061 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:53,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:53,062 INFO ]: With dead ends: 52 [2018-06-22 11:44:53,062 INFO ]: Without dead ends: 52 [2018-06-22 11:44:53,062 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:53,063 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:44:53,070 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-22 11:44:53,070 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:44:53,071 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 137 transitions. [2018-06-22 11:44:53,071 INFO ]: Start accepts. Automaton has 48 states and 137 transitions. Word has length 13 [2018-06-22 11:44:53,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:53,071 INFO ]: Abstraction has 48 states and 137 transitions. [2018-06-22 11:44:53,071 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:53,071 INFO ]: Start isEmpty. Operand 48 states and 137 transitions. [2018-06-22 11:44:53,072 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:53,072 INFO ]: Found error trace [2018-06-22 11:44:53,072 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:53,072 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:53,072 INFO ]: Analyzing trace with hash -1180170341, now seen corresponding path program 1 times [2018-06-22 11:44:53,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:53,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:53,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:53,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:53,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:53,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:53,286 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:53,286 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:53,286 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:53,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:53,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:53,303 INFO ]: Computing forward predicates... [2018-06-22 11:44:53,349 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:53,377 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:53,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:44:53,377 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:44:53,377 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:44:53,377 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:53,378 INFO ]: Start difference. First operand 48 states and 137 transitions. Second operand 8 states. [2018-06-22 11:44:53,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:53,683 INFO ]: Finished difference Result 52 states and 170 transitions. [2018-06-22 11:44:53,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:53,684 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:44:53,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:53,684 INFO ]: With dead ends: 52 [2018-06-22 11:44:53,684 INFO ]: Without dead ends: 52 [2018-06-22 11:44:53,684 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:44:53,684 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:44:53,688 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-22 11:44:53,688 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:44:53,689 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 136 transitions. [2018-06-22 11:44:53,689 INFO ]: Start accepts. Automaton has 48 states and 136 transitions. Word has length 13 [2018-06-22 11:44:53,689 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:53,689 INFO ]: Abstraction has 48 states and 136 transitions. [2018-06-22 11:44:53,689 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:44:53,689 INFO ]: Start isEmpty. Operand 48 states and 136 transitions. [2018-06-22 11:44:53,689 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:53,689 INFO ]: Found error trace [2018-06-22 11:44:53,689 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:53,689 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:53,689 INFO ]: Analyzing trace with hash -158754217, now seen corresponding path program 1 times [2018-06-22 11:44:53,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:53,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:53,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:53,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:53,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:53,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:53,784 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:53,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:53,784 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:53,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:53,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:53,803 INFO ]: Computing forward predicates... [2018-06-22 11:44:53,829 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:53,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:53,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:53,856 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:53,857 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:53,857 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:53,857 INFO ]: Start difference. First operand 48 states and 136 transitions. Second operand 6 states. [2018-06-22 11:44:54,084 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:54,084 INFO ]: Finished difference Result 52 states and 168 transitions. [2018-06-22 11:44:54,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:54,084 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:54,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:54,085 INFO ]: With dead ends: 52 [2018-06-22 11:44:54,085 INFO ]: Without dead ends: 52 [2018-06-22 11:44:54,085 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:54,085 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:44:54,090 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-06-22 11:44:54,090 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:44:54,091 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 134 transitions. [2018-06-22 11:44:54,091 INFO ]: Start accepts. Automaton has 48 states and 134 transitions. Word has length 13 [2018-06-22 11:44:54,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:54,091 INFO ]: Abstraction has 48 states and 134 transitions. [2018-06-22 11:44:54,091 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:54,091 INFO ]: Start isEmpty. Operand 48 states and 134 transitions. [2018-06-22 11:44:54,092 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:54,092 INFO ]: Found error trace [2018-06-22 11:44:54,092 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:54,092 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:54,092 INFO ]: Analyzing trace with hash -1389473141, now seen corresponding path program 1 times [2018-06-22 11:44:54,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:54,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:54,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:54,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:54,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:54,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:54,206 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:54,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:54,206 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:54,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:54,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:54,219 INFO ]: Computing forward predicates... [2018-06-22 11:44:54,287 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:54,306 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:54,306 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:54,306 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:54,306 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:54,306 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:54,306 INFO ]: Start difference. First operand 48 states and 134 transitions. Second operand 6 states. [2018-06-22 11:44:54,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:54,566 INFO ]: Finished difference Result 52 states and 164 transitions. [2018-06-22 11:44:54,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:54,566 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:54,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:54,566 INFO ]: With dead ends: 52 [2018-06-22 11:44:54,566 INFO ]: Without dead ends: 51 [2018-06-22 11:44:54,566 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:54,566 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:44:54,571 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-06-22 11:44:54,571 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:44:54,572 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 129 transitions. [2018-06-22 11:44:54,572 INFO ]: Start accepts. Automaton has 47 states and 129 transitions. Word has length 13 [2018-06-22 11:44:54,572 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:54,572 INFO ]: Abstraction has 47 states and 129 transitions. [2018-06-22 11:44:54,572 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:54,572 INFO ]: Start isEmpty. Operand 47 states and 129 transitions. [2018-06-22 11:44:54,572 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:54,572 INFO ]: Found error trace [2018-06-22 11:44:54,572 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:54,572 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:54,573 INFO ]: Analyzing trace with hash -414108248, now seen corresponding path program 1 times [2018-06-22 11:44:54,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:54,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:54,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:54,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:54,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:54,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:54,685 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:54,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:54,685 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:54,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:54,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:54,701 INFO ]: Computing forward predicates... [2018-06-22 11:44:54,739 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:54,758 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:54,758 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:54,758 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:54,758 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:54,758 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:54,758 INFO ]: Start difference. First operand 47 states and 129 transitions. Second operand 6 states. [2018-06-22 11:44:55,100 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:55,100 INFO ]: Finished difference Result 51 states and 160 transitions. [2018-06-22 11:44:55,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:55,101 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:55,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:55,102 INFO ]: With dead ends: 51 [2018-06-22 11:44:55,102 INFO ]: Without dead ends: 51 [2018-06-22 11:44:55,102 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:55,102 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:44:55,107 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-06-22 11:44:55,107 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:44:55,108 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 127 transitions. [2018-06-22 11:44:55,108 INFO ]: Start accepts. Automaton has 47 states and 127 transitions. Word has length 13 [2018-06-22 11:44:55,108 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:55,108 INFO ]: Abstraction has 47 states and 127 transitions. [2018-06-22 11:44:55,108 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:55,108 INFO ]: Start isEmpty. Operand 47 states and 127 transitions. [2018-06-22 11:44:55,109 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:55,109 INFO ]: Found error trace [2018-06-22 11:44:55,109 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:55,109 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:55,109 INFO ]: Analyzing trace with hash 1010438064, now seen corresponding path program 1 times [2018-06-22 11:44:55,109 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:55,109 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:55,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:55,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:55,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:55,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:55,251 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:55,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:55,251 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:55,256 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:55,263 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:55,264 INFO ]: Computing forward predicates... [2018-06-22 11:44:55,305 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:55,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:55,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:55,324 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:55,324 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:55,324 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:55,324 INFO ]: Start difference. First operand 47 states and 127 transitions. Second operand 7 states. [2018-06-22 11:44:55,563 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:55,563 INFO ]: Finished difference Result 53 states and 185 transitions. [2018-06-22 11:44:55,563 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:55,563 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:55,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:55,564 INFO ]: With dead ends: 53 [2018-06-22 11:44:55,564 INFO ]: Without dead ends: 53 [2018-06-22 11:44:55,564 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:55,564 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:44:55,567 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:44:55,567 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:44:55,568 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 152 transitions. [2018-06-22 11:44:55,568 INFO ]: Start accepts. Automaton has 49 states and 152 transitions. Word has length 13 [2018-06-22 11:44:55,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:55,568 INFO ]: Abstraction has 49 states and 152 transitions. [2018-06-22 11:44:55,568 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:55,568 INFO ]: Start isEmpty. Operand 49 states and 152 transitions. [2018-06-22 11:44:55,569 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:55,569 INFO ]: Found error trace [2018-06-22 11:44:55,569 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:55,569 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:55,569 INFO ]: Analyzing trace with hash -1357515815, now seen corresponding path program 1 times [2018-06-22 11:44:55,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:55,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:55,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:55,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:55,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:55,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:55,615 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:55,616 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:55,616 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:55,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:55,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:55,630 INFO ]: Computing forward predicates... [2018-06-22 11:44:55,646 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:55,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:55,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:55,665 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:55,665 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:55,665 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:55,665 INFO ]: Start difference. First operand 49 states and 152 transitions. Second operand 7 states. [2018-06-22 11:44:55,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:55,945 INFO ]: Finished difference Result 53 states and 183 transitions. [2018-06-22 11:44:55,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:55,945 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:55,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:55,945 INFO ]: With dead ends: 53 [2018-06-22 11:44:55,945 INFO ]: Without dead ends: 53 [2018-06-22 11:44:55,946 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:55,946 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:44:55,953 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:44:55,953 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:44:55,954 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-06-22 11:44:55,954 INFO ]: Start accepts. Automaton has 49 states and 150 transitions. Word has length 13 [2018-06-22 11:44:55,954 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:55,954 INFO ]: Abstraction has 49 states and 150 transitions. [2018-06-22 11:44:55,954 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:55,954 INFO ]: Start isEmpty. Operand 49 states and 150 transitions. [2018-06-22 11:44:55,955 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:55,955 INFO ]: Found error trace [2018-06-22 11:44:55,955 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:55,955 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:55,955 INFO ]: Analyzing trace with hash 1405327295, now seen corresponding path program 1 times [2018-06-22 11:44:55,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:55,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:55,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:55,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:55,955 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:55,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:55,985 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:55,985 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:55,985 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:55,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:56,001 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:56,002 INFO ]: Computing forward predicates... [2018-06-22 11:44:56,010 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:56,029 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:56,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:56,029 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:56,029 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:56,029 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:56,029 INFO ]: Start difference. First operand 49 states and 150 transitions. Second operand 6 states. [2018-06-22 11:44:56,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:56,216 INFO ]: Finished difference Result 53 states and 181 transitions. [2018-06-22 11:44:56,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:56,216 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:56,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:56,217 INFO ]: With dead ends: 53 [2018-06-22 11:44:56,217 INFO ]: Without dead ends: 53 [2018-06-22 11:44:56,217 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:56,217 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-22 11:44:56,220 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-22 11:44:56,220 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:44:56,220 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 148 transitions. [2018-06-22 11:44:56,220 INFO ]: Start accepts. Automaton has 49 states and 148 transitions. Word has length 13 [2018-06-22 11:44:56,221 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:56,221 INFO ]: Abstraction has 49 states and 148 transitions. [2018-06-22 11:44:56,221 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:56,221 INFO ]: Start isEmpty. Operand 49 states and 148 transitions. [2018-06-22 11:44:56,221 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:56,221 INFO ]: Found error trace [2018-06-22 11:44:56,221 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:56,221 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:56,221 INFO ]: Analyzing trace with hash 1916035357, now seen corresponding path program 1 times [2018-06-22 11:44:56,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:56,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:56,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:56,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:56,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:56,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:56,449 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:56,449 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:56,449 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:56,455 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:56,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:56,477 INFO ]: Computing forward predicates... [2018-06-22 11:44:56,605 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:56,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:56,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:44:56,624 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:44:56,624 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:44:56,624 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:56,624 INFO ]: Start difference. First operand 49 states and 148 transitions. Second operand 10 states. [2018-06-22 11:44:57,127 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:57,127 INFO ]: Finished difference Result 59 states and 197 transitions. [2018-06-22 11:44:57,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:44:57,128 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:44:57,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:57,128 INFO ]: With dead ends: 59 [2018-06-22 11:44:57,128 INFO ]: Without dead ends: 59 [2018-06-22 11:44:57,129 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:44:57,129 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:44:57,137 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-06-22 11:44:57,137 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:57,138 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 160 transitions. [2018-06-22 11:44:57,138 INFO ]: Start accepts. Automaton has 51 states and 160 transitions. Word has length 13 [2018-06-22 11:44:57,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:57,138 INFO ]: Abstraction has 51 states and 160 transitions. [2018-06-22 11:44:57,138 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:44:57,138 INFO ]: Start isEmpty. Operand 51 states and 160 transitions. [2018-06-22 11:44:57,139 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:57,139 INFO ]: Found error trace [2018-06-22 11:44:57,139 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:57,139 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:57,140 INFO ]: Analyzing trace with hash -1752405046, now seen corresponding path program 1 times [2018-06-22 11:44:57,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:57,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:57,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:57,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:57,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:57,144 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:57,203 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:57,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:57,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:57,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:57,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:57,217 INFO ]: Computing forward predicates... [2018-06-22 11:44:57,247 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:57,266 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:57,266 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:57,266 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:57,266 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:57,266 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:57,266 INFO ]: Start difference. First operand 51 states and 160 transitions. Second operand 6 states. [2018-06-22 11:44:57,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:57,465 INFO ]: Finished difference Result 55 states and 187 transitions. [2018-06-22 11:44:57,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:57,465 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:57,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:57,466 INFO ]: With dead ends: 55 [2018-06-22 11:44:57,466 INFO ]: Without dead ends: 55 [2018-06-22 11:44:57,466 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:57,466 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:57,471 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:57,471 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:57,471 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-06-22 11:44:57,471 INFO ]: Start accepts. Automaton has 51 states and 154 transitions. Word has length 13 [2018-06-22 11:44:57,471 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:57,471 INFO ]: Abstraction has 51 states and 154 transitions. [2018-06-22 11:44:57,471 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:57,471 INFO ]: Start isEmpty. Operand 51 states and 154 transitions. [2018-06-22 11:44:57,472 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:57,472 INFO ]: Found error trace [2018-06-22 11:44:57,472 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:57,472 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:57,472 INFO ]: Analyzing trace with hash 429962402, now seen corresponding path program 1 times [2018-06-22 11:44:57,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:57,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:57,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:57,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:57,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:57,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:57,548 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:57,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:57,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:57,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:57,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:57,561 INFO ]: Computing forward predicates... [2018-06-22 11:44:57,573 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:57,593 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:57,593 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:57,593 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:57,593 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:57,593 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:57,593 INFO ]: Start difference. First operand 51 states and 154 transitions. Second operand 6 states. [2018-06-22 11:44:57,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:57,802 INFO ]: Finished difference Result 55 states and 185 transitions. [2018-06-22 11:44:57,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:57,803 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:57,803 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:57,803 INFO ]: With dead ends: 55 [2018-06-22 11:44:57,803 INFO ]: Without dead ends: 55 [2018-06-22 11:44:57,803 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:57,803 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:57,806 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:57,806 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:57,807 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 152 transitions. [2018-06-22 11:44:57,807 INFO ]: Start accepts. Automaton has 51 states and 152 transitions. Word has length 13 [2018-06-22 11:44:57,807 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:57,807 INFO ]: Abstraction has 51 states and 152 transitions. [2018-06-22 11:44:57,807 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:57,807 INFO ]: Start isEmpty. Operand 51 states and 152 transitions. [2018-06-22 11:44:57,807 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:57,807 INFO ]: Found error trace [2018-06-22 11:44:57,807 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:57,807 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:57,807 INFO ]: Analyzing trace with hash 1962086588, now seen corresponding path program 1 times [2018-06-22 11:44:57,807 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:57,807 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:57,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:57,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:57,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:57,810 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:57,883 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:57,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:57,884 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:57,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:57,895 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:57,896 INFO ]: Computing forward predicates... [2018-06-22 11:44:57,907 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:57,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:57,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:44:57,927 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:44:57,927 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:44:57,927 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:44:57,927 INFO ]: Start difference. First operand 51 states and 152 transitions. Second operand 6 states. [2018-06-22 11:44:58,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:58,132 INFO ]: Finished difference Result 55 states and 179 transitions. [2018-06-22 11:44:58,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:44:58,132 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:44:58,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:58,133 INFO ]: With dead ends: 55 [2018-06-22 11:44:58,133 INFO ]: Without dead ends: 55 [2018-06-22 11:44:58,133 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:58,133 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:58,139 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:58,139 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:58,139 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 146 transitions. [2018-06-22 11:44:58,139 INFO ]: Start accepts. Automaton has 51 states and 146 transitions. Word has length 13 [2018-06-22 11:44:58,140 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:58,140 INFO ]: Abstraction has 51 states and 146 transitions. [2018-06-22 11:44:58,140 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:44:58,140 INFO ]: Start isEmpty. Operand 51 states and 146 transitions. [2018-06-22 11:44:58,140 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:58,140 INFO ]: Found error trace [2018-06-22 11:44:58,141 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:58,141 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:58,141 INFO ]: Analyzing trace with hash 1706732557, now seen corresponding path program 1 times [2018-06-22 11:44:58,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:58,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:58,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:58,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:58,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:58,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:58,586 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:58,586 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:58,586 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:44:58,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:58,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:58,623 INFO ]: Computing forward predicates... [2018-06-22 11:44:58,892 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:58,912 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:58,912 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:44:58,912 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:44:58,913 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:44:58,913 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:44:58,913 INFO ]: Start difference. First operand 51 states and 146 transitions. Second operand 7 states. [2018-06-22 11:44:59,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:44:59,252 INFO ]: Finished difference Result 55 states and 177 transitions. [2018-06-22 11:44:59,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:44:59,253 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:44:59,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:44:59,253 INFO ]: With dead ends: 55 [2018-06-22 11:44:59,253 INFO ]: Without dead ends: 55 [2018-06-22 11:44:59,253 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:44:59,254 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:44:59,257 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:44:59,257 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:44:59,258 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 144 transitions. [2018-06-22 11:44:59,258 INFO ]: Start accepts. Automaton has 51 states and 144 transitions. Word has length 13 [2018-06-22 11:44:59,258 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:44:59,258 INFO ]: Abstraction has 51 states and 144 transitions. [2018-06-22 11:44:59,258 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:44:59,258 INFO ]: Start isEmpty. Operand 51 states and 144 transitions. [2018-06-22 11:44:59,259 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:44:59,259 INFO ]: Found error trace [2018-06-22 11:44:59,259 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:44:59,259 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:44:59,259 INFO ]: Analyzing trace with hash 2101621788, now seen corresponding path program 1 times [2018-06-22 11:44:59,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:44:59,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:44:59,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:59,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:44:59,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:44:59,263 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:59,327 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:59,327 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:44:59,327 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:44:59,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:44:59,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:44:59,363 INFO ]: Computing forward predicates... [2018-06-22 11:44:59,549 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:44:59,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:44:59,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:44:59,581 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:44:59,581 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:44:59,581 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:44:59,581 INFO ]: Start difference. First operand 51 states and 144 transitions. Second operand 10 states. [2018-06-22 11:45:00,475 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-06-22 11:45:00,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:00,809 INFO ]: Finished difference Result 57 states and 177 transitions. [2018-06-22 11:45:00,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:00,809 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:45:00,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:00,810 INFO ]: With dead ends: 57 [2018-06-22 11:45:00,810 INFO ]: Without dead ends: 57 [2018-06-22 11:45:00,810 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:00,810 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:45:00,814 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-06-22 11:45:00,814 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:45:00,815 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 142 transitions. [2018-06-22 11:45:00,815 INFO ]: Start accepts. Automaton has 51 states and 142 transitions. Word has length 13 [2018-06-22 11:45:00,815 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:00,815 INFO ]: Abstraction has 51 states and 142 transitions. [2018-06-22 11:45:00,815 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:00,815 INFO ]: Start isEmpty. Operand 51 states and 142 transitions. [2018-06-22 11:45:00,816 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:00,816 INFO ]: Found error trace [2018-06-22 11:45:00,816 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:00,816 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:00,816 INFO ]: Analyzing trace with hash -521686122, now seen corresponding path program 1 times [2018-06-22 11:45:00,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:00,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:00,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:00,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:00,820 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:00,909 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:00,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:00,909 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:00,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:00,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:00,933 INFO ]: Computing forward predicates... [2018-06-22 11:45:01,063 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:45:01,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:01,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:01,082 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:01,082 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:01,082 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:01,083 INFO ]: Start difference. First operand 51 states and 142 transitions. Second operand 6 states. [2018-06-22 11:45:01,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:01,285 INFO ]: Finished difference Result 55 states and 173 transitions. [2018-06-22 11:45:01,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:01,285 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:01,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:01,286 INFO ]: With dead ends: 55 [2018-06-22 11:45:01,286 INFO ]: Without dead ends: 55 [2018-06-22 11:45:01,286 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:01,286 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:45:01,290 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-06-22 11:45:01,290 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:45:01,291 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 140 transitions. [2018-06-22 11:45:01,291 INFO ]: Start accepts. Automaton has 51 states and 140 transitions. Word has length 13 [2018-06-22 11:45:01,291 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:01,291 INFO ]: Abstraction has 51 states and 140 transitions. [2018-06-22 11:45:01,291 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:01,291 INFO ]: Start isEmpty. Operand 51 states and 140 transitions. [2018-06-22 11:45:01,291 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:01,291 INFO ]: Found error trace [2018-06-22 11:45:01,291 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:01,291 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:01,292 INFO ]: Analyzing trace with hash -1397013029, now seen corresponding path program 1 times [2018-06-22 11:45:01,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:01,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:01,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:01,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,298 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:01,356 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:01,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:01,356 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:01,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:01,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:01,373 INFO ]: Computing forward predicates... [2018-06-22 11:45:01,408 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:01,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:01,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:01,436 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:01,436 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:01,436 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:01,436 INFO ]: Start difference. First operand 51 states and 140 transitions. Second operand 8 states. [2018-06-22 11:45:01,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:01,840 INFO ]: Finished difference Result 61 states and 260 transitions. [2018-06-22 11:45:01,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:01,840 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:01,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:01,841 INFO ]: With dead ends: 61 [2018-06-22 11:45:01,841 INFO ]: Without dead ends: 61 [2018-06-22 11:45:01,841 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:01,841 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:01,847 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-06-22 11:45:01,847 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:01,847 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 168 transitions. [2018-06-22 11:45:01,847 INFO ]: Start accepts. Automaton has 53 states and 168 transitions. Word has length 17 [2018-06-22 11:45:01,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:01,847 INFO ]: Abstraction has 53 states and 168 transitions. [2018-06-22 11:45:01,847 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:01,847 INFO ]: Start isEmpty. Operand 53 states and 168 transitions. [2018-06-22 11:45:01,848 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:01,848 INFO ]: Found error trace [2018-06-22 11:45:01,848 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:01,848 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:01,848 INFO ]: Analyzing trace with hash -2124578266, now seen corresponding path program 1 times [2018-06-22 11:45:01,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:01,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:01,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:01,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:01,854 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:02,029 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:02,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:02,029 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:02,036 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:02,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:02,048 INFO ]: Computing forward predicates... [2018-06-22 11:45:02,109 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:02,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:02,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:45:02,129 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:02,129 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:02,129 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:02,129 INFO ]: Start difference. First operand 53 states and 168 transitions. Second operand 10 states. [2018-06-22 11:45:02,844 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:02,844 INFO ]: Finished difference Result 61 states and 256 transitions. [2018-06-22 11:45:02,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:02,844 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:02,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:02,845 INFO ]: With dead ends: 61 [2018-06-22 11:45:02,845 INFO ]: Without dead ends: 61 [2018-06-22 11:45:02,845 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:02,845 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:02,853 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-06-22 11:45:02,853 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:02,853 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 166 transitions. [2018-06-22 11:45:02,853 INFO ]: Start accepts. Automaton has 53 states and 166 transitions. Word has length 17 [2018-06-22 11:45:02,853 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:02,853 INFO ]: Abstraction has 53 states and 166 transitions. [2018-06-22 11:45:02,853 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:02,853 INFO ]: Start isEmpty. Operand 53 states and 166 transitions. [2018-06-22 11:45:02,854 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:02,854 INFO ]: Found error trace [2018-06-22 11:45:02,854 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:02,854 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:02,854 INFO ]: Analyzing trace with hash 1377940861, now seen corresponding path program 1 times [2018-06-22 11:45:02,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:02,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:02,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:02,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:02,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:02,859 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:02,911 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:02,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:02,911 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:02,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:02,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:02,928 INFO ]: Computing forward predicates... [2018-06-22 11:45:02,975 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:02,995 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:02,995 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 11:45:02,995 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:02,995 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:02,995 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:02,995 INFO ]: Start difference. First operand 53 states and 166 transitions. Second operand 9 states. [2018-06-22 11:45:03,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:03,513 INFO ]: Finished difference Result 61 states and 254 transitions. [2018-06-22 11:45:03,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:03,513 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:45:03,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:03,514 INFO ]: With dead ends: 61 [2018-06-22 11:45:03,514 INFO ]: Without dead ends: 61 [2018-06-22 11:45:03,514 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:45:03,514 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:03,523 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 53. [2018-06-22 11:45:03,523 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:03,523 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 165 transitions. [2018-06-22 11:45:03,524 INFO ]: Start accepts. Automaton has 53 states and 165 transitions. Word has length 17 [2018-06-22 11:45:03,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:03,524 INFO ]: Abstraction has 53 states and 165 transitions. [2018-06-22 11:45:03,524 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:03,524 INFO ]: Start isEmpty. Operand 53 states and 165 transitions. [2018-06-22 11:45:03,525 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:03,525 INFO ]: Found error trace [2018-06-22 11:45:03,525 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:03,525 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:03,525 INFO ]: Analyzing trace with hash -869637782, now seen corresponding path program 1 times [2018-06-22 11:45:03,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:03,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:03,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:03,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:03,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:03,530 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:03,622 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:03,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:03,623 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:03,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:03,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:03,639 INFO ]: Computing forward predicates... [2018-06-22 11:45:03,668 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:03,687 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:03,687 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:03,687 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:03,687 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:03,687 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:03,687 INFO ]: Start difference. First operand 53 states and 165 transitions. Second operand 8 states. [2018-06-22 11:45:04,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:04,097 INFO ]: Finished difference Result 63 states and 279 transitions. [2018-06-22 11:45:04,100 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:04,100 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:04,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:04,101 INFO ]: With dead ends: 63 [2018-06-22 11:45:04,101 INFO ]: Without dead ends: 63 [2018-06-22 11:45:04,101 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:04,101 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:04,111 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:04,111 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:04,111 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 215 transitions. [2018-06-22 11:45:04,111 INFO ]: Start accepts. Automaton has 57 states and 215 transitions. Word has length 17 [2018-06-22 11:45:04,111 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:04,112 INFO ]: Abstraction has 57 states and 215 transitions. [2018-06-22 11:45:04,112 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:04,112 INFO ]: Start isEmpty. Operand 57 states and 215 transitions. [2018-06-22 11:45:04,113 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:04,113 INFO ]: Found error trace [2018-06-22 11:45:04,113 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:04,113 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:04,113 INFO ]: Analyzing trace with hash 1575360254, now seen corresponding path program 1 times [2018-06-22 11:45:04,113 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:04,113 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:04,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:04,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:04,118 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:04,242 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:04,242 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:04,242 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:04,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:04,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:04,259 INFO ]: Computing forward predicates... [2018-06-22 11:45:04,308 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:04,337 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:04,337 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:45:04,337 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:04,337 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:04,337 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:04,338 INFO ]: Start difference. First operand 57 states and 215 transitions. Second operand 7 states. [2018-06-22 11:45:05,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:05,325 INFO ]: Finished difference Result 63 states and 269 transitions. [2018-06-22 11:45:05,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:05,325 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:05,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:05,326 INFO ]: With dead ends: 63 [2018-06-22 11:45:05,326 INFO ]: Without dead ends: 63 [2018-06-22 11:45:05,326 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:05,327 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:05,332 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:05,332 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:05,333 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 205 transitions. [2018-06-22 11:45:05,333 INFO ]: Start accepts. Automaton has 57 states and 205 transitions. Word has length 17 [2018-06-22 11:45:05,333 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:05,333 INFO ]: Abstraction has 57 states and 205 transitions. [2018-06-22 11:45:05,333 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:05,333 INFO ]: Start isEmpty. Operand 57 states and 205 transitions. [2018-06-22 11:45:05,336 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:05,336 INFO ]: Found error trace [2018-06-22 11:45:05,336 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:05,336 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:05,336 INFO ]: Analyzing trace with hash 980331478, now seen corresponding path program 1 times [2018-06-22 11:45:05,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:05,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:05,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,337 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:05,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,342 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:05,411 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:05,411 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:05,411 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:05,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:05,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:05,427 INFO ]: Computing forward predicates... [2018-06-22 11:45:05,458 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:05,477 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:05,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:05,478 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:05,478 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:05,478 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:05,478 INFO ]: Start difference. First operand 57 states and 205 transitions. Second operand 8 states. [2018-06-22 11:45:05,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:05,867 INFO ]: Finished difference Result 63 states and 263 transitions. [2018-06-22 11:45:05,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:05,868 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:05,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:05,868 INFO ]: With dead ends: 63 [2018-06-22 11:45:05,868 INFO ]: Without dead ends: 63 [2018-06-22 11:45:05,868 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:05,868 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:05,874 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:05,874 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:05,875 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 199 transitions. [2018-06-22 11:45:05,875 INFO ]: Start accepts. Automaton has 57 states and 199 transitions. Word has length 17 [2018-06-22 11:45:05,875 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:05,875 INFO ]: Abstraction has 57 states and 199 transitions. [2018-06-22 11:45:05,875 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:05,875 INFO ]: Start isEmpty. Operand 57 states and 199 transitions. [2018-06-22 11:45:05,877 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:05,877 INFO ]: Found error trace [2018-06-22 11:45:05,877 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:05,877 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:05,877 INFO ]: Analyzing trace with hash 1643013783, now seen corresponding path program 1 times [2018-06-22 11:45:05,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:05,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:05,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:05,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:05,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:05,938 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:05,938 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:05,938 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:05,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:05,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:05,955 INFO ]: Computing forward predicates... [2018-06-22 11:45:05,989 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:06,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:06,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:45:06,008 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:06,008 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:06,008 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:06,009 INFO ]: Start difference. First operand 57 states and 199 transitions. Second operand 7 states. [2018-06-22 11:45:06,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:06,405 INFO ]: Finished difference Result 63 states and 255 transitions. [2018-06-22 11:45:06,406 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:06,406 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:06,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:06,406 INFO ]: With dead ends: 63 [2018-06-22 11:45:06,406 INFO ]: Without dead ends: 63 [2018-06-22 11:45:06,407 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:06,407 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:06,415 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:06,415 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:06,416 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 191 transitions. [2018-06-22 11:45:06,416 INFO ]: Start accepts. Automaton has 57 states and 191 transitions. Word has length 17 [2018-06-22 11:45:06,416 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:06,416 INFO ]: Abstraction has 57 states and 191 transitions. [2018-06-22 11:45:06,416 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:06,416 INFO ]: Start isEmpty. Operand 57 states and 191 transitions. [2018-06-22 11:45:06,417 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:06,417 INFO ]: Found error trace [2018-06-22 11:45:06,417 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:06,417 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:06,417 INFO ]: Analyzing trace with hash -1332130097, now seen corresponding path program 1 times [2018-06-22 11:45:06,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:06,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:06,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:06,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:06,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:06,424 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:06,782 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:06,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:06,782 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:06,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:06,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:06,799 INFO ]: Computing forward predicates... [2018-06-22 11:45:06,812 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:06,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:06,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:45:06,833 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:06,833 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:06,833 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:06,833 INFO ]: Start difference. First operand 57 states and 191 transitions. Second operand 7 states. [2018-06-22 11:45:07,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:07,225 INFO ]: Finished difference Result 63 states and 253 transitions. [2018-06-22 11:45:07,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:07,225 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:07,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:07,226 INFO ]: With dead ends: 63 [2018-06-22 11:45:07,226 INFO ]: Without dead ends: 63 [2018-06-22 11:45:07,226 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:07,226 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:07,230 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:07,230 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:07,231 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 189 transitions. [2018-06-22 11:45:07,231 INFO ]: Start accepts. Automaton has 57 states and 189 transitions. Word has length 17 [2018-06-22 11:45:07,231 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:07,231 INFO ]: Abstraction has 57 states and 189 transitions. [2018-06-22 11:45:07,231 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:07,231 INFO ]: Start isEmpty. Operand 57 states and 189 transitions. [2018-06-22 11:45:07,232 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:07,232 INFO ]: Found error trace [2018-06-22 11:45:07,232 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:07,232 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:07,232 INFO ]: Analyzing trace with hash 1313057929, now seen corresponding path program 1 times [2018-06-22 11:45:07,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:07,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:07,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:07,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:07,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:07,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:07,313 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:07,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:07,313 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:07,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:07,328 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:07,330 INFO ]: Computing forward predicates... [2018-06-22 11:45:07,353 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:07,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:07,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:45:07,373 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:07,373 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:07,373 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:07,373 INFO ]: Start difference. First operand 57 states and 189 transitions. Second operand 7 states. [2018-06-22 11:45:08,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:08,012 INFO ]: Finished difference Result 63 states and 251 transitions. [2018-06-22 11:45:08,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:08,012 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:08,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:08,013 INFO ]: With dead ends: 63 [2018-06-22 11:45:08,013 INFO ]: Without dead ends: 63 [2018-06-22 11:45:08,013 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:08,013 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:08,017 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:08,017 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:08,017 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 187 transitions. [2018-06-22 11:45:08,017 INFO ]: Start accepts. Automaton has 57 states and 187 transitions. Word has length 17 [2018-06-22 11:45:08,017 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:08,017 INFO ]: Abstraction has 57 states and 187 transitions. [2018-06-22 11:45:08,017 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:08,017 INFO ]: Start isEmpty. Operand 57 states and 187 transitions. [2018-06-22 11:45:08,018 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:08,018 INFO ]: Found error trace [2018-06-22 11:45:08,018 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:08,018 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:08,018 INFO ]: Analyzing trace with hash -142072545, now seen corresponding path program 1 times [2018-06-22 11:45:08,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:08,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:08,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:08,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:08,092 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:08,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:08,092 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:08,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:08,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:08,107 INFO ]: Computing forward predicates... [2018-06-22 11:45:08,142 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:08,160 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:08,160 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:08,160 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:08,160 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:08,160 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:08,160 INFO ]: Start difference. First operand 57 states and 187 transitions. Second operand 8 states. [2018-06-22 11:45:08,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:08,512 INFO ]: Finished difference Result 63 states and 245 transitions. [2018-06-22 11:45:08,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:08,513 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:08,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:08,513 INFO ]: With dead ends: 63 [2018-06-22 11:45:08,513 INFO ]: Without dead ends: 63 [2018-06-22 11:45:08,513 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:08,513 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:08,517 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:08,517 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:08,518 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 181 transitions. [2018-06-22 11:45:08,518 INFO ]: Start accepts. Automaton has 57 states and 181 transitions. Word has length 17 [2018-06-22 11:45:08,518 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:08,518 INFO ]: Abstraction has 57 states and 181 transitions. [2018-06-22 11:45:08,518 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:08,518 INFO ]: Start isEmpty. Operand 57 states and 181 transitions. [2018-06-22 11:45:08,519 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:08,519 INFO ]: Found error trace [2018-06-22 11:45:08,519 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:08,519 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:08,519 INFO ]: Analyzing trace with hash -407145467, now seen corresponding path program 1 times [2018-06-22 11:45:08,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:08,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:08,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:08,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:08,524 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:08,736 WARN ]: Spent 170.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-06-22 11:45:08,829 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:08,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:08,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:08,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:08,844 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:08,845 INFO ]: Computing forward predicates... [2018-06-22 11:45:08,968 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:08,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:08,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 11:45:08,987 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:08,987 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:08,987 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:08,987 INFO ]: Start difference. First operand 57 states and 181 transitions. Second operand 9 states. [2018-06-22 11:45:09,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:09,428 INFO ]: Finished difference Result 63 states and 243 transitions. [2018-06-22 11:45:09,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:09,429 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:45:09,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:09,429 INFO ]: With dead ends: 63 [2018-06-22 11:45:09,429 INFO ]: Without dead ends: 63 [2018-06-22 11:45:09,429 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:45:09,430 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:09,434 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:09,434 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:09,434 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 179 transitions. [2018-06-22 11:45:09,434 INFO ]: Start accepts. Automaton has 57 states and 179 transitions. Word has length 17 [2018-06-22 11:45:09,434 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:09,434 INFO ]: Abstraction has 57 states and 179 transitions. [2018-06-22 11:45:09,434 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:09,435 INFO ]: Start isEmpty. Operand 57 states and 179 transitions. [2018-06-22 11:45:09,435 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:09,435 INFO ]: Found error trace [2018-06-22 11:45:09,435 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:09,436 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:09,436 INFO ]: Analyzing trace with hash -1662085951, now seen corresponding path program 1 times [2018-06-22 11:45:09,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:09,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:09,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:09,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:09,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:09,440 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:09,767 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:45:10,192 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:10,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:10,192 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:10,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:10,228 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:10,230 INFO ]: Computing forward predicates... [2018-06-22 11:45:10,390 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:10,410 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:10,410 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:10,410 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:10,410 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:10,410 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:10,410 INFO ]: Start difference. First operand 57 states and 179 transitions. Second operand 8 states. [2018-06-22 11:45:10,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:10,802 INFO ]: Finished difference Result 63 states and 241 transitions. [2018-06-22 11:45:10,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:10,802 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:10,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:10,803 INFO ]: With dead ends: 63 [2018-06-22 11:45:10,803 INFO ]: Without dead ends: 63 [2018-06-22 11:45:10,803 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:10,803 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:10,809 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:10,809 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:10,810 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 177 transitions. [2018-06-22 11:45:10,810 INFO ]: Start accepts. Automaton has 57 states and 177 transitions. Word has length 17 [2018-06-22 11:45:10,810 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:10,810 INFO ]: Abstraction has 57 states and 177 transitions. [2018-06-22 11:45:10,810 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:10,810 INFO ]: Start isEmpty. Operand 57 states and 177 transitions. [2018-06-22 11:45:10,811 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:10,811 INFO ]: Found error trace [2018-06-22 11:45:10,811 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:10,811 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:10,811 INFO ]: Analyzing trace with hash -737101321, now seen corresponding path program 1 times [2018-06-22 11:45:10,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:10,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:10,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:10,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:10,816 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:11,123 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:11,123 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:11,123 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:11,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:11,145 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:11,146 INFO ]: Computing forward predicates... [2018-06-22 11:45:11,165 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:11,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:11,184 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:45:11,184 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:11,184 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:11,184 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:11,184 INFO ]: Start difference. First operand 57 states and 177 transitions. Second operand 7 states. [2018-06-22 11:45:11,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:11,594 INFO ]: Finished difference Result 63 states and 239 transitions. [2018-06-22 11:45:11,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:11,594 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:11,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:11,595 INFO ]: With dead ends: 63 [2018-06-22 11:45:11,595 INFO ]: Without dead ends: 63 [2018-06-22 11:45:11,595 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:11,595 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:11,602 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:11,603 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:11,603 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 175 transitions. [2018-06-22 11:45:11,603 INFO ]: Start accepts. Automaton has 57 states and 175 transitions. Word has length 17 [2018-06-22 11:45:11,603 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:11,603 INFO ]: Abstraction has 57 states and 175 transitions. [2018-06-22 11:45:11,603 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:11,603 INFO ]: Start isEmpty. Operand 57 states and 175 transitions. [2018-06-22 11:45:11,604 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:11,604 INFO ]: Found error trace [2018-06-22 11:45:11,604 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:11,604 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:11,605 INFO ]: Analyzing trace with hash -274609006, now seen corresponding path program 1 times [2018-06-22 11:45:11,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:11,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:11,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:11,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:11,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:11,610 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:11,928 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:11,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:11,928 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:11,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:11,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:11,949 INFO ]: Computing forward predicates... [2018-06-22 11:45:11,977 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:11,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:11,997 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:11,997 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:11,997 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:11,997 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:11,997 INFO ]: Start difference. First operand 57 states and 175 transitions. Second operand 8 states. [2018-06-22 11:45:12,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:12,372 INFO ]: Finished difference Result 63 states and 237 transitions. [2018-06-22 11:45:12,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:12,372 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:12,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:12,373 INFO ]: With dead ends: 63 [2018-06-22 11:45:12,373 INFO ]: Without dead ends: 63 [2018-06-22 11:45:12,373 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:12,373 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:12,378 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-06-22 11:45:12,378 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:12,378 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 156 transitions. [2018-06-22 11:45:12,378 INFO ]: Start accepts. Automaton has 53 states and 156 transitions. Word has length 17 [2018-06-22 11:45:12,378 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:12,378 INFO ]: Abstraction has 53 states and 156 transitions. [2018-06-22 11:45:12,378 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:12,378 INFO ]: Start isEmpty. Operand 53 states and 156 transitions. [2018-06-22 11:45:12,379 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:12,379 INFO ]: Found error trace [2018-06-22 11:45:12,379 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:12,379 INFO ]: === Iteration 61 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:12,380 INFO ]: Analyzing trace with hash -1923223210, now seen corresponding path program 1 times [2018-06-22 11:45:12,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:12,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:12,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:12,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:12,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:12,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:12,427 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:12,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:12,427 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:12,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:12,444 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:12,445 INFO ]: Computing forward predicates... [2018-06-22 11:45:12,498 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:12,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:12,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:12,525 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:12,525 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:12,525 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:12,526 INFO ]: Start difference. First operand 53 states and 156 transitions. Second operand 8 states. [2018-06-22 11:45:12,882 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:12,882 INFO ]: Finished difference Result 61 states and 245 transitions. [2018-06-22 11:45:12,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:12,907 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:12,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:12,908 INFO ]: With dead ends: 61 [2018-06-22 11:45:12,908 INFO ]: Without dead ends: 61 [2018-06-22 11:45:12,908 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:12,908 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:12,914 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-06-22 11:45:12,914 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:12,915 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 181 transitions. [2018-06-22 11:45:12,915 INFO ]: Start accepts. Automaton has 55 states and 181 transitions. Word has length 17 [2018-06-22 11:45:12,915 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:12,915 INFO ]: Abstraction has 55 states and 181 transitions. [2018-06-22 11:45:12,915 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:12,915 INFO ]: Start isEmpty. Operand 55 states and 181 transitions. [2018-06-22 11:45:12,916 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:12,916 INFO ]: Found error trace [2018-06-22 11:45:12,916 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:12,916 INFO ]: === Iteration 62 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:12,916 INFO ]: Analyzing trace with hash 124165443, now seen corresponding path program 1 times [2018-06-22 11:45:12,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:12,916 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:12,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:12,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:12,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:12,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:13,063 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:13,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:13,064 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:13,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:13,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:13,080 INFO ]: Computing forward predicates... [2018-06-22 11:45:13,108 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:13,127 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:13,127 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:13,127 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:13,127 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:13,127 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:13,127 INFO ]: Start difference. First operand 55 states and 181 transitions. Second operand 8 states. [2018-06-22 11:45:13,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:13,510 INFO ]: Finished difference Result 61 states and 243 transitions. [2018-06-22 11:45:13,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:13,511 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:13,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:13,511 INFO ]: With dead ends: 61 [2018-06-22 11:45:13,511 INFO ]: Without dead ends: 61 [2018-06-22 11:45:13,511 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:13,511 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:13,519 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-06-22 11:45:13,519 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:13,519 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 179 transitions. [2018-06-22 11:45:13,519 INFO ]: Start accepts. Automaton has 55 states and 179 transitions. Word has length 17 [2018-06-22 11:45:13,519 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:13,519 INFO ]: Abstraction has 55 states and 179 transitions. [2018-06-22 11:45:13,519 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:13,519 INFO ]: Start isEmpty. Operand 55 states and 179 transitions. [2018-06-22 11:45:13,520 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:13,520 INFO ]: Found error trace [2018-06-22 11:45:13,520 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:13,520 INFO ]: === Iteration 63 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:13,520 INFO ]: Analyzing trace with hash -668282726, now seen corresponding path program 1 times [2018-06-22 11:45:13,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:13,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:13,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:13,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:13,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:13,523 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:13,695 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:13,695 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:13,695 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:13,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:13,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:13,712 INFO ]: Computing forward predicates... [2018-06-22 11:45:13,737 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:13,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:13,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:13,756 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:13,756 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:13,756 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:13,756 INFO ]: Start difference. First operand 55 states and 179 transitions. Second operand 8 states. [2018-06-22 11:45:14,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:14,158 INFO ]: Finished difference Result 61 states and 237 transitions. [2018-06-22 11:45:14,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:14,158 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:14,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:14,159 INFO ]: With dead ends: 61 [2018-06-22 11:45:14,159 INFO ]: Without dead ends: 61 [2018-06-22 11:45:14,159 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:14,159 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:45:14,165 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-06-22 11:45:14,165 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:14,165 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 173 transitions. [2018-06-22 11:45:14,165 INFO ]: Start accepts. Automaton has 55 states and 173 transitions. Word has length 17 [2018-06-22 11:45:14,166 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:14,166 INFO ]: Abstraction has 55 states and 173 transitions. [2018-06-22 11:45:14,166 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:14,166 INFO ]: Start isEmpty. Operand 55 states and 173 transitions. [2018-06-22 11:45:14,167 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:14,167 INFO ]: Found error trace [2018-06-22 11:45:14,167 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:14,167 INFO ]: === Iteration 64 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:14,168 INFO ]: Analyzing trace with hash -140907479, now seen corresponding path program 1 times [2018-06-22 11:45:14,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:14,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:14,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:14,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:14,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:14,396 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2018-06-22 11:45:14,412 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:14,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:14,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:14,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:14,427 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:14,429 INFO ]: Computing forward predicates... [2018-06-22 11:45:14,605 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:14,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:14,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-06-22 11:45:14,624 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:14,624 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:14,624 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:14,624 INFO ]: Start difference. First operand 55 states and 173 transitions. Second operand 10 states. [2018-06-22 11:45:15,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:15,138 INFO ]: Finished difference Result 63 states and 253 transitions. [2018-06-22 11:45:15,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:15,138 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:15,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:15,138 INFO ]: With dead ends: 63 [2018-06-22 11:45:15,138 INFO ]: Without dead ends: 63 [2018-06-22 11:45:15,138 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:15,139 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:15,143 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-06-22 11:45:15,143 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:15,143 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 171 transitions. [2018-06-22 11:45:15,143 INFO ]: Start accepts. Automaton has 55 states and 171 transitions. Word has length 17 [2018-06-22 11:45:15,143 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:15,143 INFO ]: Abstraction has 55 states and 171 transitions. [2018-06-22 11:45:15,143 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:15,143 INFO ]: Start isEmpty. Operand 55 states and 171 transitions. [2018-06-22 11:45:15,144 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:15,144 INFO ]: Found error trace [2018-06-22 11:45:15,144 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:15,144 INFO ]: === Iteration 65 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:15,145 INFO ]: Analyzing trace with hash -403209804, now seen corresponding path program 1 times [2018-06-22 11:45:15,145 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:15,145 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:15,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:15,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,148 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:15,593 WARN ]: Spent 343.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2018-06-22 11:45:15,610 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:15,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:15,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:15,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:15,625 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:15,626 INFO ]: Computing forward predicates... [2018-06-22 11:45:15,646 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:15,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:15,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:15,665 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:15,665 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:15,665 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:15,666 INFO ]: Start difference. First operand 55 states and 171 transitions. Second operand 8 states. [2018-06-22 11:45:15,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:15,962 INFO ]: Finished difference Result 59 states and 201 transitions. [2018-06-22 11:45:15,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:45:15,962 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:15,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:15,963 INFO ]: With dead ends: 59 [2018-06-22 11:45:15,963 INFO ]: Without dead ends: 59 [2018-06-22 11:45:15,963 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:15,963 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:45:15,966 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-06-22 11:45:15,966 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:45:15,966 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 168 transitions. [2018-06-22 11:45:15,967 INFO ]: Start accepts. Automaton has 55 states and 168 transitions. Word has length 17 [2018-06-22 11:45:15,967 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:15,967 INFO ]: Abstraction has 55 states and 168 transitions. [2018-06-22 11:45:15,967 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:15,967 INFO ]: Start isEmpty. Operand 55 states and 168 transitions. [2018-06-22 11:45:15,968 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:15,968 INFO ]: Found error trace [2018-06-22 11:45:15,968 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:15,968 INFO ]: === Iteration 66 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:15,968 INFO ]: Analyzing trace with hash -1195657973, now seen corresponding path program 1 times [2018-06-22 11:45:15,968 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:15,968 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:15,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:15,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:15,972 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:16,024 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:16,024 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:16,024 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:16,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:16,041 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:16,042 INFO ]: Computing forward predicates... [2018-06-22 11:45:16,156 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:16,175 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:16,175 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:45:16,175 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:16,175 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:16,175 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:16,175 INFO ]: Start difference. First operand 55 states and 168 transitions. Second operand 10 states. [2018-06-22 11:45:16,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:16,571 INFO ]: Finished difference Result 63 states and 241 transitions. [2018-06-22 11:45:16,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:16,571 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:16,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:16,572 INFO ]: With dead ends: 63 [2018-06-22 11:45:16,572 INFO ]: Without dead ends: 63 [2018-06-22 11:45:16,572 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:16,572 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:16,576 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-06-22 11:45:16,576 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:16,577 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 160 transitions. [2018-06-22 11:45:16,577 INFO ]: Start accepts. Automaton has 53 states and 160 transitions. Word has length 17 [2018-06-22 11:45:16,577 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:16,577 INFO ]: Abstraction has 53 states and 160 transitions. [2018-06-22 11:45:16,577 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:16,577 INFO ]: Start isEmpty. Operand 53 states and 160 transitions. [2018-06-22 11:45:16,577 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:16,577 INFO ]: Found error trace [2018-06-22 11:45:16,577 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:16,578 INFO ]: === Iteration 67 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:16,578 INFO ]: Analyzing trace with hash 1379105927, now seen corresponding path program 1 times [2018-06-22 11:45:16,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:16,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:16,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:16,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:16,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:16,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:16,614 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:16,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:16,614 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:16,619 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:16,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:16,629 INFO ]: Computing forward predicates... [2018-06-22 11:45:16,665 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:16,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:16,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:45:16,683 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:16,683 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:16,683 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:16,684 INFO ]: Start difference. First operand 53 states and 160 transitions. Second operand 10 states. [2018-06-22 11:45:17,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:17,028 INFO ]: Finished difference Result 63 states and 237 transitions. [2018-06-22 11:45:17,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:17,028 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:17,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:17,029 INFO ]: With dead ends: 63 [2018-06-22 11:45:17,029 INFO ]: Without dead ends: 63 [2018-06-22 11:45:17,029 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:17,029 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:17,033 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-06-22 11:45:17,033 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:17,033 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 158 transitions. [2018-06-22 11:45:17,033 INFO ]: Start accepts. Automaton has 53 states and 158 transitions. Word has length 17 [2018-06-22 11:45:17,033 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:17,033 INFO ]: Abstraction has 53 states and 158 transitions. [2018-06-22 11:45:17,033 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:17,033 INFO ]: Start isEmpty. Operand 53 states and 158 transitions. [2018-06-22 11:45:17,034 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:17,034 INFO ]: Found error trace [2018-06-22 11:45:17,034 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:17,034 INFO ]: === Iteration 68 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:17,034 INFO ]: Analyzing trace with hash -733165658, now seen corresponding path program 1 times [2018-06-22 11:45:17,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:17,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:17,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:17,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,037 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:17,089 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:17,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:17,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:17,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:17,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:17,104 INFO ]: Computing forward predicates... [2018-06-22 11:45:17,145 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:17,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:17,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:17,164 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:17,164 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:17,164 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:17,164 INFO ]: Start difference. First operand 53 states and 158 transitions. Second operand 8 states. [2018-06-22 11:45:17,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:17,504 INFO ]: Finished difference Result 57 states and 188 transitions. [2018-06-22 11:45:17,507 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:45:17,507 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:17,507 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:17,508 INFO ]: With dead ends: 57 [2018-06-22 11:45:17,508 INFO ]: Without dead ends: 57 [2018-06-22 11:45:17,508 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:17,508 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:45:17,513 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:45:17,513 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:17,513 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 155 transitions. [2018-06-22 11:45:17,514 INFO ]: Start accepts. Automaton has 53 states and 155 transitions. Word has length 17 [2018-06-22 11:45:17,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:17,514 INFO ]: Abstraction has 53 states and 155 transitions. [2018-06-22 11:45:17,514 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:17,514 INFO ]: Start isEmpty. Operand 53 states and 155 transitions. [2018-06-22 11:45:17,515 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:17,515 INFO ]: Found error trace [2018-06-22 11:45:17,515 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:17,515 INFO ]: === Iteration 69 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:17,515 INFO ]: Analyzing trace with hash 654311287, now seen corresponding path program 1 times [2018-06-22 11:45:17,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:17,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:17,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:17,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:17,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:17,823 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:45:18,099 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:18,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:18,099 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:18,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:18,113 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:18,115 INFO ]: Computing forward predicates... [2018-06-22 11:45:18,152 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:18,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:18,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:18,171 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:18,171 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:18,171 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:18,171 INFO ]: Start difference. First operand 53 states and 155 transitions. Second operand 8 states. [2018-06-22 11:45:18,463 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:18,463 INFO ]: Finished difference Result 59 states and 218 transitions. [2018-06-22 11:45:18,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:18,463 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:18,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:18,464 INFO ]: With dead ends: 59 [2018-06-22 11:45:18,464 INFO ]: Without dead ends: 59 [2018-06-22 11:45:18,464 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:18,464 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:45:18,467 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-06-22 11:45:18,467 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:18,468 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 154 transitions. [2018-06-22 11:45:18,468 INFO ]: Start accepts. Automaton has 53 states and 154 transitions. Word has length 17 [2018-06-22 11:45:18,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:18,468 INFO ]: Abstraction has 53 states and 154 transitions. [2018-06-22 11:45:18,468 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:18,468 INFO ]: Start isEmpty. Operand 53 states and 154 transitions. [2018-06-22 11:45:18,469 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:18,469 INFO ]: Found error trace [2018-06-22 11:45:18,469 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:18,469 INFO ]: === Iteration 70 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:18,469 INFO ]: Analyzing trace with hash 1181686534, now seen corresponding path program 1 times [2018-06-22 11:45:18,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:18,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:18,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:18,469 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:18,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:18,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:18,540 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:18,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:18,540 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:18,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:18,556 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:18,557 INFO ]: Computing forward predicates... [2018-06-22 11:45:18,613 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:18,634 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:18,634 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:45:18,634 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:18,634 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:18,634 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:18,634 INFO ]: Start difference. First operand 53 states and 154 transitions. Second operand 10 states. [2018-06-22 11:45:18,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:18,935 INFO ]: Finished difference Result 63 states and 227 transitions. [2018-06-22 11:45:18,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:18,935 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:45:18,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:18,936 INFO ]: With dead ends: 63 [2018-06-22 11:45:18,936 INFO ]: Without dead ends: 63 [2018-06-22 11:45:18,936 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:18,937 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:18,943 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-06-22 11:45:18,943 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:18,944 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 153 transitions. [2018-06-22 11:45:18,944 INFO ]: Start accepts. Automaton has 53 states and 153 transitions. Word has length 17 [2018-06-22 11:45:18,944 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:18,944 INFO ]: Abstraction has 53 states and 153 transitions. [2018-06-22 11:45:18,944 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:18,944 INFO ]: Start isEmpty. Operand 53 states and 153 transitions. [2018-06-22 11:45:18,945 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:18,945 INFO ]: Found error trace [2018-06-22 11:45:18,945 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:18,945 INFO ]: === Iteration 71 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:18,945 INFO ]: Analyzing trace with hash -998238580, now seen corresponding path program 1 times [2018-06-22 11:45:18,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:18,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:18,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:18,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:18,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:18,949 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,164 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2018-06-22 11:45:19,180 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:19,180 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:19,180 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:19,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:19,197 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,198 INFO ]: Computing forward predicates... [2018-06-22 11:45:19,217 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:19,236 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:19,236 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:19,236 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:19,236 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:19,236 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:19,236 INFO ]: Start difference. First operand 53 states and 153 transitions. Second operand 8 states. [2018-06-22 11:45:19,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:19,487 INFO ]: Finished difference Result 57 states and 185 transitions. [2018-06-22 11:45:19,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:45:19,488 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:19,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:19,488 INFO ]: With dead ends: 57 [2018-06-22 11:45:19,488 INFO ]: Without dead ends: 57 [2018-06-22 11:45:19,488 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:19,488 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:45:19,491 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:45:19,491 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:19,491 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 152 transitions. [2018-06-22 11:45:19,491 INFO ]: Start accepts. Automaton has 53 states and 152 transitions. Word has length 17 [2018-06-22 11:45:19,491 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:19,491 INFO ]: Abstraction has 53 states and 152 transitions. [2018-06-22 11:45:19,491 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:19,491 INFO ]: Start isEmpty. Operand 53 states and 152 transitions. [2018-06-22 11:45:19,492 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:19,492 INFO ]: Found error trace [2018-06-22 11:45:19,492 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:19,492 INFO ]: === Iteration 72 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:19,492 INFO ]: Analyzing trace with hash -933355648, now seen corresponding path program 1 times [2018-06-22 11:45:19,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:19,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:19,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:19,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:19,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:19,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,614 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:19,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:19,614 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:19,620 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:19,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:19,632 INFO ]: Computing forward predicates... [2018-06-22 11:45:19,665 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:45:19,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:19,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:19,684 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:19,684 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:19,684 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:19,684 INFO ]: Start difference. First operand 53 states and 152 transitions. Second operand 8 states. [2018-06-22 11:45:20,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:20,028 INFO ]: Finished difference Result 59 states and 215 transitions. [2018-06-22 11:45:20,028 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:20,028 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:20,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:20,029 INFO ]: With dead ends: 59 [2018-06-22 11:45:20,029 INFO ]: Without dead ends: 59 [2018-06-22 11:45:20,029 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:20,029 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:45:20,033 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-06-22 11:45:20,033 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:45:20,033 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 143 transitions. [2018-06-22 11:45:20,033 INFO ]: Start accepts. Automaton has 49 states and 143 transitions. Word has length 17 [2018-06-22 11:45:20,033 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:20,033 INFO ]: Abstraction has 49 states and 143 transitions. [2018-06-22 11:45:20,033 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:20,033 INFO ]: Start isEmpty. Operand 49 states and 143 transitions. [2018-06-22 11:45:20,034 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:20,034 INFO ]: Found error trace [2018-06-22 11:45:20,034 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:20,034 INFO ]: === Iteration 73 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:20,034 INFO ]: Analyzing trace with hash -1570132694, now seen corresponding path program 2 times [2018-06-22 11:45:20,034 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:20,034 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:20,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:20,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,038 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:20,087 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:20,087 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:20,087 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:20,093 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:20,104 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:20,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:20,105 INFO ]: Computing forward predicates... [2018-06-22 11:45:20,206 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:20,225 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:20,225 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:45:20,225 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:20,225 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:20,225 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:20,225 INFO ]: Start difference. First operand 49 states and 143 transitions. Second operand 8 states. [2018-06-22 11:45:20,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:20,958 INFO ]: Finished difference Result 63 states and 264 transitions. [2018-06-22 11:45:20,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:20,958 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:20,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:20,959 INFO ]: With dead ends: 63 [2018-06-22 11:45:20,959 INFO ]: Without dead ends: 63 [2018-06-22 11:45:20,959 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:20,959 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:20,964 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:20,964 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:20,965 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 200 transitions. [2018-06-22 11:45:20,965 INFO ]: Start accepts. Automaton has 57 states and 200 transitions. Word has length 17 [2018-06-22 11:45:20,965 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:20,965 INFO ]: Abstraction has 57 states and 200 transitions. [2018-06-22 11:45:20,965 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:20,965 INFO ]: Start isEmpty. Operand 57 states and 200 transitions. [2018-06-22 11:45:20,966 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:20,966 INFO ]: Found error trace [2018-06-22 11:45:20,966 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:20,966 INFO ]: === Iteration 74 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:20,966 INFO ]: Analyzing trace with hash 279836566, now seen corresponding path program 2 times [2018-06-22 11:45:20,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:20,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:20,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,967 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:20,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:20,971 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:21,385 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:21,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:21,385 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:21,391 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:21,400 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:21,400 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:21,401 INFO ]: Computing forward predicates... [2018-06-22 11:45:21,430 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:21,449 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:21,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:45:21,449 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:21,449 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:21,449 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:21,449 INFO ]: Start difference. First operand 57 states and 200 transitions. Second operand 8 states. [2018-06-22 11:45:22,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:22,003 INFO ]: Finished difference Result 63 states and 260 transitions. [2018-06-22 11:45:22,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:22,004 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:22,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:22,004 INFO ]: With dead ends: 63 [2018-06-22 11:45:22,004 INFO ]: Without dead ends: 63 [2018-06-22 11:45:22,004 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:22,004 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:22,009 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:22,009 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:22,009 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 196 transitions. [2018-06-22 11:45:22,009 INFO ]: Start accepts. Automaton has 57 states and 196 transitions. Word has length 17 [2018-06-22 11:45:22,009 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:22,009 INFO ]: Abstraction has 57 states and 196 transitions. [2018-06-22 11:45:22,009 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:22,009 INFO ]: Start isEmpty. Operand 57 states and 196 transitions. [2018-06-22 11:45:22,010 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:22,010 INFO ]: Found error trace [2018-06-22 11:45:22,010 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:22,010 INFO ]: === Iteration 75 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:22,011 INFO ]: Analyzing trace with hash 1337357657, now seen corresponding path program 1 times [2018-06-22 11:45:22,011 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:22,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:22,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:22,011 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:22,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:22,015 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:22,687 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:22,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:22,687 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:22,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:22,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:22,705 INFO ]: Computing forward predicates... [2018-06-22 11:45:22,737 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:22,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:22,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:45:22,755 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:22,756 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:22,756 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:22,756 INFO ]: Start difference. First operand 57 states and 196 transitions. Second operand 9 states. [2018-06-22 11:45:23,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:23,291 INFO ]: Finished difference Result 63 states and 250 transitions. [2018-06-22 11:45:23,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:45:23,291 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:45:23,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:23,292 INFO ]: With dead ends: 63 [2018-06-22 11:45:23,292 INFO ]: Without dead ends: 63 [2018-06-22 11:45:23,292 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:45:23,292 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:23,296 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:23,296 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:23,296 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 186 transitions. [2018-06-22 11:45:23,296 INFO ]: Start accepts. Automaton has 57 states and 186 transitions. Word has length 17 [2018-06-22 11:45:23,296 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:23,296 INFO ]: Abstraction has 57 states and 186 transitions. [2018-06-22 11:45:23,296 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:23,296 INFO ]: Start isEmpty. Operand 57 states and 186 transitions. [2018-06-22 11:45:23,297 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:23,297 INFO ]: Found error trace [2018-06-22 11:45:23,297 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:23,297 INFO ]: === Iteration 76 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:23,297 INFO ]: Analyzing trace with hash 942518871, now seen corresponding path program 2 times [2018-06-22 11:45:23,297 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:23,297 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:23,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:23,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:23,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:23,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:23,347 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:23,347 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:23,347 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:23,353 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:23,362 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:23,362 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:23,363 INFO ]: Computing forward predicates... [2018-06-22 11:45:23,377 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-06-22 11:45:23,377 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:45:23,378 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:45:23,378 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:7 [2018-06-22 11:45:23,437 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:23,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:23,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-22 11:45:23,461 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:45:23,461 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:45:23,461 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:45:23,461 INFO ]: Start difference. First operand 57 states and 186 transitions. Second operand 9 states. [2018-06-22 11:45:24,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:24,303 INFO ]: Finished difference Result 63 states and 242 transitions. [2018-06-22 11:45:24,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:24,303 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:45:24,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:24,304 INFO ]: With dead ends: 63 [2018-06-22 11:45:24,304 INFO ]: Without dead ends: 63 [2018-06-22 11:45:24,304 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:45:24,304 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:24,311 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:24,311 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:24,312 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 178 transitions. [2018-06-22 11:45:24,312 INFO ]: Start accepts. Automaton has 57 states and 178 transitions. Word has length 17 [2018-06-22 11:45:24,312 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:24,312 INFO ]: Abstraction has 57 states and 178 transitions. [2018-06-22 11:45:24,312 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:45:24,312 INFO ]: Start isEmpty. Operand 57 states and 178 transitions. [2018-06-22 11:45:24,313 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:24,313 INFO ]: Found error trace [2018-06-22 11:45:24,313 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:24,313 INFO ]: === Iteration 77 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:24,313 INFO ]: Analyzing trace with hash 612563017, now seen corresponding path program 2 times [2018-06-22 11:45:24,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:24,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:24,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:24,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:24,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:24,318 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:24,524 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:24,524 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:24,524 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:24,529 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:24,539 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:24,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:24,540 INFO ]: Computing forward predicates... [2018-06-22 11:45:24,558 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:24,576 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:24,576 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:45:24,576 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:24,577 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:24,577 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:24,577 INFO ]: Start difference. First operand 57 states and 178 transitions. Second operand 8 states. [2018-06-22 11:45:25,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:25,081 INFO ]: Finished difference Result 63 states and 240 transitions. [2018-06-22 11:45:25,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:45:25,081 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:25,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:25,082 INFO ]: With dead ends: 63 [2018-06-22 11:45:25,082 INFO ]: Without dead ends: 63 [2018-06-22 11:45:25,082 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:45:25,082 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:45:25,090 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 11:45:25,090 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 11:45:25,090 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 176 transitions. [2018-06-22 11:45:25,090 INFO ]: Start accepts. Automaton has 57 states and 176 transitions. Word has length 17 [2018-06-22 11:45:25,090 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:25,090 INFO ]: Abstraction has 57 states and 176 transitions. [2018-06-22 11:45:25,090 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:25,090 INFO ]: Start isEmpty. Operand 57 states and 176 transitions. [2018-06-22 11:45:25,091 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:25,091 INFO ]: Found error trace [2018-06-22 11:45:25,091 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:25,092 INFO ]: === Iteration 78 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:25,092 INFO ]: Analyzing trace with hash -975103918, now seen corresponding path program 2 times [2018-06-22 11:45:25,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:25,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:25,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:25,092 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:25,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:25,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:25,169 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:25,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:25,169 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:25,176 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:45:25,187 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:25,187 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:25,188 INFO ]: Computing forward predicates... [2018-06-22 11:45:25,514 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 11:45:25,904 WARN ]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 11:45:25,979 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:25,997 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:25,997 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:45:25,997 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:45:25,997 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:45:25,998 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:25,998 INFO ]: Start difference. First operand 57 states and 176 transitions. Second operand 13 states. Received shutdown request... [2018-06-22 11:45:27,417 WARN ]: Removed 10 from assertion stack [2018-06-22 11:45:27,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:45:27,417 WARN ]: Verification canceled [2018-06-22 11:45:27,420 WARN ]: Timeout [2018-06-22 11:45:27,421 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:45:27 BoogieIcfgContainer [2018-06-22 11:45:27,421 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:45:27,421 INFO ]: Toolchain (without parser) took 55574.73 ms. Allocated memory was 308.8 MB in the beginning and 866.6 MB in the end (delta: 557.8 MB). Free memory was 243.3 MB in the beginning and 753.9 MB in the end (delta: -510.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:27,422 INFO ]: SmtParser took 0.12 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:45:27,422 INFO ]: ChcToBoogie took 58.17 ms. Allocated memory is still 308.8 MB. Free memory was 243.3 MB in the beginning and 240.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:27,423 INFO ]: Boogie Preprocessor took 50.43 ms. Allocated memory is still 308.8 MB. Free memory was 240.3 MB in the beginning and 238.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:27,423 INFO ]: RCFGBuilder took 1253.19 ms. Allocated memory is still 308.8 MB. Free memory was 238.3 MB in the beginning and 202.3 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:27,423 INFO ]: TraceAbstraction took 54202.86 ms. Allocated memory was 308.8 MB in the beginning and 866.6 MB in the end (delta: 557.8 MB). Free memory was 202.3 MB in the beginning and 753.9 MB in the end (delta: -551.7 MB). Peak memory consumption was 6.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:45:27,425 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.12 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.17 ms. Allocated memory is still 308.8 MB. Free memory was 243.3 MB in the beginning and 240.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 50.43 ms. Allocated memory is still 308.8 MB. Free memory was 240.3 MB in the beginning and 238.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1253.19 ms. Allocated memory is still 308.8 MB. Free memory was 238.3 MB in the beginning and 202.3 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54202.86 ms. Allocated memory was 308.8 MB in the beginning and 866.6 MB in the end (delta: 557.8 MB). Free memory was 202.3 MB in the beginning and 753.9 MB in the end (delta: -551.7 MB). Peak memory consumption was 6.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 26 states, 13 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 63. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 locations, 1 error locations. TIMEOUT Result, 54.1s OverallTime, 78 OverallIterations, 3 TraceHistogramMax, 33.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7006 SDtfs, 350 SDslu, 16799 SDs, 0 SdLazy, 33518 SolverSat, 777 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1460 GetRequests, 755 SyntacticMatches, 182 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 77 MinimizatonAttempts, 374 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 1967 NumberOfCodeBlocks, 1967 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 1832 ConstructedInterpolants, 2 QuantifiedInterpolants, 155048 SizeOfPredicates, 330 NumberOfNonLiveVariables, 4541 ConjunctsInSsa, 1612 ConjunctsInUnsatCore, 135 InterpolantComputations, 21 PerfectInterpolantSequences, 360/756 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strchr_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-45-27-434.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strchr_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-45-27-434.csv Completed graceful shutdown