java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:44:11,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:44:11,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:44:11,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:44:11,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:44:11,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:44:11,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:44:11,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:44:11,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:44:11,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:44:11,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:44:11,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:44:11,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:44:11,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:44:11,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:44:11,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:44:11,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:44:11,586 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:44:11,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:44:11,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:44:11,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:44:11,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:44:11,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:44:11,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:44:11,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:44:11,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:44:11,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:44:11,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:44:11,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:44:11,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:44:11,605 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:44:11,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:44:11,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:44:11,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:44:11,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:44:11,608 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:44:11,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:44:11,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:44:11,622 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:44:11,623 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:44:11,624 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:44:11,624 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:44:11,624 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:44:11,624 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:44:11,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:44:11,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:44:11,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:44:11,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:44:11,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:44:11,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:44:11,626 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:44:11,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:44:11,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:44:11,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:44:11,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:44:11,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:44:11,627 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:44:11,629 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:44:11,629 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:44:11,679 INFO ]: Repository-Root is: /tmp [2018-06-25 06:44:11,692 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:44:11,696 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:44:11,698 INFO ]: Initializing SmtParser... [2018-06-25 06:44:11,698 INFO ]: SmtParser initialized [2018-06-25 06:44:11,699 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 [2018-06-25 06:44:11,700 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-25 06:44:11,801 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 unknown [2018-06-25 06:44:12,194 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2 [2018-06-25 06:44:12,200 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:44:12,205 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:44:12,206 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:44:12,206 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:44:12,206 INFO ]: ChcToBoogie initialized [2018-06-25 06:44:12,210 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,288 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12 Unit [2018-06-25 06:44:12,288 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:44:12,289 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:44:12,289 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:44:12,289 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:44:12,307 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,308 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,314 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,314 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,324 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,325 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,327 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,330 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:44:12,331 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:44:12,331 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:44:12,331 INFO ]: RCFGBuilder initialized [2018-06-25 06:44:12,337 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 06:44:12,347 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:44:12,347 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:44:12,347 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:44:12,347 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:44:12,347 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:44:12,347 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:44:12,723 INFO ]: Using library mode [2018-06-25 06:44:12,724 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:44:12 BoogieIcfgContainer [2018-06-25 06:44:12,724 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:44:12,724 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:44:12,724 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:44:12,726 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:44:12,726 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:44:12" (1/1) ... [2018-06-25 06:44:12,743 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:44:12,745 INFO ]: Using Remove infeasible edges [2018-06-25 06:44:12,745 INFO ]: Using Maximize final states [2018-06-25 06:44:12,747 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:44:12,747 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:44:12,748 INFO ]: Using Remove sink states [2018-06-25 06:44:12,749 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:44:12,749 INFO ]: Using Use SBE [2018-06-25 06:44:12,759 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:44:13,958 WARN ]: aborting because of expected exponential blowup for input size 49 [2018-06-25 06:44:13,959 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:44:14,132 WARN ]: Simplifying disjunction of 6912 conjuctions. This might take some time... [2018-06-25 06:44:17,801 INFO ]: Simplified to disjunction of 3888 conjuctions. [2018-06-25 06:44:18,020 WARN ]: aborting because of expected exponential blowup for input size 49 [2018-06-25 06:44:18,034 INFO ]: SBE split 2 edges [2018-06-25 06:44:18,075 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:44:18,079 INFO ]: 0 new accepting states [2018-06-25 06:44:29,948 INFO ]: Removed 1218 edges and 2 locations by large block encoding [2018-06-25 06:44:29,950 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:44:29,990 INFO ]: Removed 28 edges and 0 locations because of local infeasibility [2018-06-25 06:44:29,990 INFO ]: 0 new accepting states [2018-06-25 06:44:29,992 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:44:29,992 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:44:30,123 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:44:30,124 INFO ]: 0 new accepting states [2018-06-25 06:44:30,126 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:44:30,126 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:44:30,168 INFO ]: Encoded RCFG 6 locations, 1192 edges [2018-06-25 06:44:30,169 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:44:30 BasicIcfg [2018-06-25 06:44:30,169 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:44:30,170 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:44:30,170 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:44:30,175 INFO ]: TraceAbstraction initialized [2018-06-25 06:44:30,175 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:44:12" (1/4) ... [2018-06-25 06:44:30,177 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d4a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:44:30, skipping insertion in model container [2018-06-25 06:44:30,177 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:44:12" (2/4) ... [2018-06-25 06:44:30,178 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d4a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:44:30, skipping insertion in model container [2018-06-25 06:44:30,178 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:44:12" (3/4) ... [2018-06-25 06:44:30,178 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d4a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:44:30, skipping insertion in model container [2018-06-25 06:44:30,178 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:44:30" (4/4) ... [2018-06-25 06:44:30,183 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:44:30,197 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:44:30,207 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:44:30,254 INFO ]: Using default assertion order modulation [2018-06-25 06:44:30,255 INFO ]: Interprodecural is true [2018-06-25 06:44:30,255 INFO ]: Hoare is false [2018-06-25 06:44:30,255 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:44:30,258 INFO ]: Backedges is TWOTRACK [2018-06-25 06:44:30,258 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:44:30,258 INFO ]: Difference is false [2018-06-25 06:44:30,258 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:44:30,258 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:44:30,283 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:44:30,300 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:44:30,300 INFO ]: Found error trace [2018-06-25 06:44:30,301 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:44:30,301 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:30,307 INFO ]: Analyzing trace with hash 98321154, now seen corresponding path program 1 times [2018-06-25 06:44:30,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:30,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:30,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:30,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:30,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:30,395 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:30,514 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:30,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:30,517 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:30,518 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:30,529 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:30,530 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:30,533 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:44:33,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:33,080 INFO ]: Finished difference Result 8 states and 1274 transitions. [2018-06-25 06:44:33,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:33,081 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:44:33,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:33,100 INFO ]: With dead ends: 8 [2018-06-25 06:44:33,100 INFO ]: Without dead ends: 8 [2018-06-25 06:44:33,102 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:33,122 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:33,179 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:44:33,180 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:44:33,183 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1273 transitions. [2018-06-25 06:44:33,185 INFO ]: Start accepts. Automaton has 7 states and 1273 transitions. Word has length 5 [2018-06-25 06:44:33,186 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:33,186 INFO ]: Abstraction has 7 states and 1273 transitions. [2018-06-25 06:44:33,186 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:33,186 INFO ]: Start isEmpty. Operand 7 states and 1273 transitions. [2018-06-25 06:44:33,187 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:44:33,187 INFO ]: Found error trace [2018-06-25 06:44:33,187 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:44:33,187 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:33,187 INFO ]: Analyzing trace with hash 98443201, now seen corresponding path program 1 times [2018-06-25 06:44:33,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:33,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:33,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:33,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:33,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:33,206 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:33,241 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:33,242 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:33,242 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:33,243 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:33,243 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:33,243 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:33,243 INFO ]: Start difference. First operand 7 states and 1273 transitions. Second operand 3 states. [2018-06-25 06:44:35,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:35,349 INFO ]: Finished difference Result 8 states and 1194 transitions. [2018-06-25 06:44:35,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:35,349 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:44:35,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:35,351 INFO ]: With dead ends: 8 [2018-06-25 06:44:35,351 INFO ]: Without dead ends: 8 [2018-06-25 06:44:35,352 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:35,352 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:35,360 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:44:35,360 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:44:35,363 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1193 transitions. [2018-06-25 06:44:35,363 INFO ]: Start accepts. Automaton has 7 states and 1193 transitions. Word has length 5 [2018-06-25 06:44:35,363 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:35,363 INFO ]: Abstraction has 7 states and 1193 transitions. [2018-06-25 06:44:35,363 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:35,363 INFO ]: Start isEmpty. Operand 7 states and 1193 transitions. [2018-06-25 06:44:35,364 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:35,364 INFO ]: Found error trace [2018-06-25 06:44:35,364 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:35,364 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:35,364 INFO ]: Analyzing trace with hash -1313443371, now seen corresponding path program 1 times [2018-06-25 06:44:35,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:35,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:35,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:35,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:35,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:35,415 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:35,496 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:35,496 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:35,496 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:35,496 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:35,496 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:35,496 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:35,496 INFO ]: Start difference. First operand 7 states and 1193 transitions. Second operand 3 states. [2018-06-25 06:44:37,601 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:37,601 INFO ]: Finished difference Result 8 states and 1193 transitions. [2018-06-25 06:44:37,602 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:37,602 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:37,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:37,605 INFO ]: With dead ends: 8 [2018-06-25 06:44:37,605 INFO ]: Without dead ends: 7 [2018-06-25 06:44:37,605 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:37,605 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:44:37,611 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:44:37,611 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:44:37,614 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2018-06-25 06:44:37,614 INFO ]: Start accepts. Automaton has 7 states and 937 transitions. Word has length 6 [2018-06-25 06:44:37,614 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:37,614 INFO ]: Abstraction has 7 states and 937 transitions. [2018-06-25 06:44:37,614 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:37,615 INFO ]: Start isEmpty. Operand 7 states and 937 transitions. [2018-06-25 06:44:37,615 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:37,615 INFO ]: Found error trace [2018-06-25 06:44:37,615 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:37,615 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:37,615 INFO ]: Analyzing trace with hash -1311596329, now seen corresponding path program 1 times [2018-06-25 06:44:37,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:37,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:37,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:37,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:37,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:37,675 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:37,727 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:37,728 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:37,728 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-25 06:44:37,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:37,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:37,830 INFO ]: Computing forward predicates... [2018-06-25 06:44:37,907 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:37,931 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 06:44:37,931 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 06:44:37,931 INFO ]: Interpolant automaton has 5 states [2018-06-25 06:44:37,931 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 06:44:37,932 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:44:37,932 INFO ]: Start difference. First operand 7 states and 937 transitions. Second operand 5 states. [2018-06-25 06:44:40,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:40,855 INFO ]: Finished difference Result 11 states and 939 transitions. [2018-06-25 06:44:40,855 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:44:40,855 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 06:44:40,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:40,856 INFO ]: With dead ends: 11 [2018-06-25 06:44:40,856 INFO ]: Without dead ends: 9 [2018-06-25 06:44:40,856 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 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-25 06:44:40,856 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:44:40,860 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 06:44:40,860 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:40,862 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 426 transitions. [2018-06-25 06:44:40,862 INFO ]: Start accepts. Automaton has 8 states and 426 transitions. Word has length 6 [2018-06-25 06:44:40,862 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:40,862 INFO ]: Abstraction has 8 states and 426 transitions. [2018-06-25 06:44:40,862 INFO ]: Interpolant automaton has 5 states. [2018-06-25 06:44:40,862 INFO ]: Start isEmpty. Operand 8 states and 426 transitions. [2018-06-25 06:44:40,863 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:40,863 INFO ]: Found error trace [2018-06-25 06:44:40,863 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:40,863 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:40,863 INFO ]: Analyzing trace with hash -1310672808, now seen corresponding path program 1 times [2018-06-25 06:44:40,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:40,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:40,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:40,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:40,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:40,900 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:40,948 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:40,948 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:40,948 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:40,949 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:40,949 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:40,949 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:40,949 INFO ]: Start difference. First operand 8 states and 426 transitions. Second operand 3 states. [2018-06-25 06:44:42,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:42,177 INFO ]: Finished difference Result 10 states and 426 transitions. [2018-06-25 06:44:42,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:42,180 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:42,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:42,181 INFO ]: With dead ends: 10 [2018-06-25 06:44:42,181 INFO ]: Without dead ends: 8 [2018-06-25 06:44:42,181 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:42,181 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:42,184 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:44:42,184 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:42,185 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 394 transitions. [2018-06-25 06:44:42,185 INFO ]: Start accepts. Automaton has 8 states and 394 transitions. Word has length 6 [2018-06-25 06:44:42,185 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:42,185 INFO ]: Abstraction has 8 states and 394 transitions. [2018-06-25 06:44:42,185 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:42,185 INFO ]: Start isEmpty. Operand 8 states and 394 transitions. [2018-06-25 06:44:42,186 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:42,186 INFO ]: Found error trace [2018-06-25 06:44:42,186 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:42,186 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:42,186 INFO ]: Analyzing trace with hash -1309749287, now seen corresponding path program 1 times [2018-06-25 06:44:42,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:42,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:42,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:42,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:42,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:42,213 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:42,296 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:42,296 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:42,296 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:42,296 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:42,297 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:42,297 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:42,297 INFO ]: Start difference. First operand 8 states and 394 transitions. Second operand 3 states. [2018-06-25 06:44:42,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:42,791 INFO ]: Finished difference Result 10 states and 394 transitions. [2018-06-25 06:44:42,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:42,791 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:42,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:42,792 INFO ]: With dead ends: 10 [2018-06-25 06:44:42,792 INFO ]: Without dead ends: 8 [2018-06-25 06:44:42,792 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:42,792 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:42,794 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:44:42,795 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:42,795 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 362 transitions. [2018-06-25 06:44:42,796 INFO ]: Start accepts. Automaton has 8 states and 362 transitions. Word has length 6 [2018-06-25 06:44:42,796 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:42,796 INFO ]: Abstraction has 8 states and 362 transitions. [2018-06-25 06:44:42,796 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:42,796 INFO ]: Start isEmpty. Operand 8 states and 362 transitions. [2018-06-25 06:44:42,796 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:42,796 INFO ]: Found error trace [2018-06-25 06:44:42,796 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:42,796 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:42,796 INFO ]: Analyzing trace with hash -2014395810, now seen corresponding path program 1 times [2018-06-25 06:44:42,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:42,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:42,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:42,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:42,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:42,816 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:42,880 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:42,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:42,880 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:42,880 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:42,880 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:42,880 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:42,880 INFO ]: Start difference. First operand 8 states and 362 transitions. Second operand 3 states. [2018-06-25 06:44:43,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:43,889 INFO ]: Finished difference Result 10 states and 362 transitions. [2018-06-25 06:44:43,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:43,890 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:43,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:43,891 INFO ]: With dead ends: 10 [2018-06-25 06:44:43,891 INFO ]: Without dead ends: 8 [2018-06-25 06:44:43,891 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:43,891 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:43,893 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:44:43,893 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:43,894 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2018-06-25 06:44:43,894 INFO ]: Start accepts. Automaton has 8 states and 346 transitions. Word has length 6 [2018-06-25 06:44:43,894 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:43,894 INFO ]: Abstraction has 8 states and 346 transitions. [2018-06-25 06:44:43,894 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:43,894 INFO ]: Start isEmpty. Operand 8 states and 346 transitions. [2018-06-25 06:44:43,894 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:43,895 INFO ]: Found error trace [2018-06-25 06:44:43,895 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:43,895 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:43,895 INFO ]: Analyzing trace with hash -1539706016, now seen corresponding path program 1 times [2018-06-25 06:44:43,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:43,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:43,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:43,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:43,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:43,917 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:43,974 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:43,974 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:43,974 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:43,974 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:43,974 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:43,974 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:43,974 INFO ]: Start difference. First operand 8 states and 346 transitions. Second operand 3 states. [2018-06-25 06:44:44,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:44,330 INFO ]: Finished difference Result 10 states and 346 transitions. [2018-06-25 06:44:44,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:44,330 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:44,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:44,331 INFO ]: With dead ends: 10 [2018-06-25 06:44:44,331 INFO ]: Without dead ends: 8 [2018-06-25 06:44:44,331 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:44,331 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:44,333 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:44:44,333 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:44,333 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 306 transitions. [2018-06-25 06:44:44,333 INFO ]: Start accepts. Automaton has 8 states and 306 transitions. Word has length 6 [2018-06-25 06:44:44,333 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:44,333 INFO ]: Abstraction has 8 states and 306 transitions. [2018-06-25 06:44:44,333 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:44,333 INFO ]: Start isEmpty. Operand 8 states and 306 transitions. [2018-06-25 06:44:44,333 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:44,333 INFO ]: Found error trace [2018-06-25 06:44:44,333 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:44,333 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:44,333 INFO ]: Analyzing trace with hash -1775203871, now seen corresponding path program 1 times [2018-06-25 06:44:44,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:44,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:44,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:44,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:44,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:44,351 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:44,464 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:44,464 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:44,464 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:44,464 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:44,464 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:44,464 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:44,464 INFO ]: Start difference. First operand 8 states and 306 transitions. Second operand 3 states. [2018-06-25 06:44:44,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:44,778 INFO ]: Finished difference Result 10 states and 306 transitions. [2018-06-25 06:44:44,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:44,779 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:44,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:44,779 INFO ]: With dead ends: 10 [2018-06-25 06:44:44,779 INFO ]: Without dead ends: 8 [2018-06-25 06:44:44,779 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:44,779 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:44,781 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:44:44,781 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:44,782 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 290 transitions. [2018-06-25 06:44:44,782 INFO ]: Start accepts. Automaton has 8 states and 290 transitions. Word has length 6 [2018-06-25 06:44:44,782 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:44,782 INFO ]: Abstraction has 8 states and 290 transitions. [2018-06-25 06:44:44,782 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:44,782 INFO ]: Start isEmpty. Operand 8 states and 290 transitions. [2018-06-25 06:44:44,782 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:44,782 INFO ]: Found error trace [2018-06-25 06:44:44,782 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:44,782 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:44,783 INFO ]: Analyzing trace with hash -1296819993, now seen corresponding path program 1 times [2018-06-25 06:44:44,783 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:44,783 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:44,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:44,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:44,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:44,803 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:44,870 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:44,870 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:44,870 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:44,870 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:44,870 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:44,870 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:44,870 INFO ]: Start difference. First operand 8 states and 290 transitions. Second operand 3 states. [2018-06-25 06:44:45,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:45,210 INFO ]: Finished difference Result 10 states and 290 transitions. [2018-06-25 06:44:45,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:45,211 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:45,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:45,211 INFO ]: With dead ends: 10 [2018-06-25 06:44:45,211 INFO ]: Without dead ends: 8 [2018-06-25 06:44:45,211 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:45,211 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:44:45,213 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:44:45,213 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:45,213 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2018-06-25 06:44:45,213 INFO ]: Start accepts. Automaton has 8 states and 210 transitions. Word has length 6 [2018-06-25 06:44:45,214 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:45,214 INFO ]: Abstraction has 8 states and 210 transitions. [2018-06-25 06:44:45,214 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:45,214 INFO ]: Start isEmpty. Operand 8 states and 210 transitions. [2018-06-25 06:44:45,214 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:45,214 INFO ]: Found error trace [2018-06-25 06:44:45,214 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:45,214 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:45,214 INFO ]: Analyzing trace with hash -1490759403, now seen corresponding path program 1 times [2018-06-25 06:44:45,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:45,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:45,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:45,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:45,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:45,239 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:45,388 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:45,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:45,388 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) [2018-06-25 06:44:45,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:44:45,460 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:45,463 INFO ]: Computing forward predicates... [2018-06-25 06:44:45,630 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:45,663 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 06:44:45,663 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 06:44:45,663 INFO ]: Interpolant automaton has 5 states [2018-06-25 06:44:45,663 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 06:44:45,663 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:44:45,663 INFO ]: Start difference. First operand 8 states and 210 transitions. Second operand 5 states. [2018-06-25 06:44:46,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:46,407 INFO ]: Finished difference Result 11 states and 212 transitions. [2018-06-25 06:44:46,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:44:46,407 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 06:44:46,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:46,409 INFO ]: With dead ends: 11 [2018-06-25 06:44:46,409 INFO ]: Without dead ends: 10 [2018-06-25 06:44:46,409 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:44:46,409 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:44:46,411 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 06:44:46,411 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:46,411 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2018-06-25 06:44:46,411 INFO ]: Start accepts. Automaton has 8 states and 200 transitions. Word has length 6 [2018-06-25 06:44:46,412 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:46,412 INFO ]: Abstraction has 8 states and 200 transitions. [2018-06-25 06:44:46,412 INFO ]: Interpolant automaton has 5 states. [2018-06-25 06:44:46,412 INFO ]: Start isEmpty. Operand 8 states and 200 transitions. [2018-06-25 06:44:46,412 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:46,412 INFO ]: Found error trace [2018-06-25 06:44:46,412 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:46,412 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:46,412 INFO ]: Analyzing trace with hash -1717945569, now seen corresponding path program 1 times [2018-06-25 06:44:46,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:46,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:46,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:46,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:46,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:46,430 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:46,536 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:46,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:46,536 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-25 06:44:46,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:46,605 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:46,608 INFO ]: Computing forward predicates... [2018-06-25 06:44:47,182 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 14 [2018-06-25 06:44:47,189 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:47,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:44:47,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:44:47,210 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:44:47,210 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:44:47,210 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:44:47,210 INFO ]: Start difference. First operand 8 states and 200 transitions. Second operand 6 states. [2018-06-25 06:44:47,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:47,938 INFO ]: Finished difference Result 13 states and 205 transitions. [2018-06-25 06:44:47,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:44:47,939 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:44:47,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:47,939 INFO ]: With dead ends: 13 [2018-06-25 06:44:47,939 INFO ]: Without dead ends: 13 [2018-06-25 06:44:47,939 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:44:47,939 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 06:44:47,941 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-25 06:44:47,941 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:44:47,942 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2018-06-25 06:44:47,942 INFO ]: Start accepts. Automaton has 8 states and 200 transitions. Word has length 6 [2018-06-25 06:44:47,942 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:47,942 INFO ]: Abstraction has 8 states and 200 transitions. [2018-06-25 06:44:47,942 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:44:47,942 INFO ]: Start isEmpty. Operand 8 states and 200 transitions. [2018-06-25 06:44:47,942 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:47,942 INFO ]: Found error trace [2018-06-25 06:44:47,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:47,942 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:47,942 INFO ]: Analyzing trace with hash -1758580493, now seen corresponding path program 1 times [2018-06-25 06:44:47,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:47,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:47,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:47,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:47,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:47,963 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:48,091 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:48,091 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:48,091 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-25 06:44:48,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:48,142 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:48,145 INFO ]: Computing forward predicates... [2018-06-25 06:44:48,395 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:48,418 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:44:48,418 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:44:48,418 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:44:48,418 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:44:48,418 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:44:48,419 INFO ]: Start difference. First operand 8 states and 200 transitions. Second operand 6 states. [2018-06-25 06:44:49,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:49,282 INFO ]: Finished difference Result 13 states and 205 transitions. [2018-06-25 06:44:49,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:44:49,283 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:44:49,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:49,283 INFO ]: With dead ends: 13 [2018-06-25 06:44:49,283 INFO ]: Without dead ends: 13 [2018-06-25 06:44:49,283 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:44:49,283 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 06:44:49,285 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 06:44:49,285 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:44:49,285 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-06-25 06:44:49,285 INFO ]: Start accepts. Automaton has 9 states and 201 transitions. Word has length 6 [2018-06-25 06:44:49,285 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:49,285 INFO ]: Abstraction has 9 states and 201 transitions. [2018-06-25 06:44:49,285 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:44:49,285 INFO ]: Start isEmpty. Operand 9 states and 201 transitions. [2018-06-25 06:44:49,286 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:49,286 INFO ]: Found error trace [2018-06-25 06:44:49,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:49,286 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:49,286 INFO ]: Analyzing trace with hash -1268190842, now seen corresponding path program 1 times [2018-06-25 06:44:49,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:49,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:49,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:49,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:49,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:49,303 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:49,479 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 06:44:49,487 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:49,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:49,487 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-25 06:44:49,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:49,542 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:49,544 INFO ]: Computing forward predicates... [2018-06-25 06:44:49,574 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:49,595 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:44:49,595 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:44:49,595 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:44:49,595 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:44:49,595 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:44:49,595 INFO ]: Start difference. First operand 9 states and 201 transitions. Second operand 6 states. [2018-06-25 06:44:50,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:50,409 INFO ]: Finished difference Result 14 states and 206 transitions. [2018-06-25 06:44:50,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:44:50,409 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:44:50,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:50,409 INFO ]: With dead ends: 14 [2018-06-25 06:44:50,409 INFO ]: Without dead ends: 14 [2018-06-25 06:44:50,410 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:44:50,410 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 06:44:50,411 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-25 06:44:50,411 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:44:50,412 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2018-06-25 06:44:50,412 INFO ]: Start accepts. Automaton has 9 states and 201 transitions. Word has length 6 [2018-06-25 06:44:50,412 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:50,412 INFO ]: Abstraction has 9 states and 201 transitions. [2018-06-25 06:44:50,412 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:44:50,412 INFO ]: Start isEmpty. Operand 9 states and 201 transitions. [2018-06-25 06:44:50,412 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:50,412 INFO ]: Found error trace [2018-06-25 06:44:50,412 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:50,412 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:50,413 INFO ]: Analyzing trace with hash -1142591986, now seen corresponding path program 1 times [2018-06-25 06:44:50,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:50,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:50,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:50,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:50,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:50,428 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:50,476 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:50,476 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:50,476 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:50,477 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:50,477 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:50,477 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:50,477 INFO ]: Start difference. First operand 9 states and 201 transitions. Second operand 3 states. [2018-06-25 06:44:50,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:50,683 INFO ]: Finished difference Result 11 states and 201 transitions. [2018-06-25 06:44:50,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:50,684 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:44:50,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:50,684 INFO ]: With dead ends: 11 [2018-06-25 06:44:50,684 INFO ]: Without dead ends: 9 [2018-06-25 06:44:50,684 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:50,684 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:44:50,686 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 06:44:50,686 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:44:50,686 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-06-25 06:44:50,686 INFO ]: Start accepts. Automaton has 9 states and 195 transitions. Word has length 6 [2018-06-25 06:44:50,686 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:50,686 INFO ]: Abstraction has 9 states and 195 transitions. [2018-06-25 06:44:50,686 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:50,686 INFO ]: Start isEmpty. Operand 9 states and 195 transitions. [2018-06-25 06:44:50,687 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:44:50,687 INFO ]: Found error trace [2018-06-25 06:44:50,687 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:44:50,687 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:50,687 INFO ]: Analyzing trace with hash -1609893612, now seen corresponding path program 1 times [2018-06-25 06:44:50,687 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:50,687 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:50,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:50,688 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:50,688 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:50,702 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:50,893 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:50,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:50,893 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-25 06:44:50,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:50,941 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:50,943 INFO ]: Computing forward predicates... [2018-06-25 06:44:50,958 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:44:51,022 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:51,044 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:44:51,044 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 06:44:51,045 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:44:51,045 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:44:51,045 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:44:51,045 INFO ]: Start difference. First operand 9 states and 195 transitions. Second operand 6 states. [2018-06-25 06:44:51,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:51,746 INFO ]: Finished difference Result 15 states and 201 transitions. [2018-06-25 06:44:51,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:44:51,867 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 06:44:51,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:51,868 INFO ]: With dead ends: 15 [2018-06-25 06:44:51,868 INFO ]: Without dead ends: 15 [2018-06-25 06:44:51,868 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:44:51,868 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 06:44:51,872 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-25 06:44:51,872 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:44:51,872 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-06-25 06:44:51,872 INFO ]: Start accepts. Automaton has 9 states and 195 transitions. Word has length 6 [2018-06-25 06:44:51,872 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:51,872 INFO ]: Abstraction has 9 states and 195 transitions. [2018-06-25 06:44:51,872 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:44:51,872 INFO ]: Start isEmpty. Operand 9 states and 195 transitions. [2018-06-25 06:44:51,873 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:44:51,873 INFO ]: Found error trace [2018-06-25 06:44:51,873 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:44:51,873 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:51,873 INFO ]: Analyzing trace with hash 1939841986, now seen corresponding path program 1 times [2018-06-25 06:44:51,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:51,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:51,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:51,873 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:51,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:51,899 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:52,725 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-06-25 06:44:52,763 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:52,763 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:52,763 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-25 06:44:52,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:52,849 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:52,854 INFO ]: Computing forward predicates... [2018-06-25 06:44:53,069 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 06:44:53,883 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:53,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:44:53,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:44:53,905 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:44:53,905 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:44:53,905 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:44:53,905 INFO ]: Start difference. First operand 9 states and 195 transitions. Second operand 8 states. [2018-06-25 06:44:54,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:54,927 INFO ]: Finished difference Result 13 states and 199 transitions. [2018-06-25 06:44:54,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:44:54,927 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:44:54,927 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:54,928 INFO ]: With dead ends: 13 [2018-06-25 06:44:54,928 INFO ]: Without dead ends: 13 [2018-06-25 06:44:54,928 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-25 06:44:54,928 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 06:44:54,929 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 06:44:54,929 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:44:54,929 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2018-06-25 06:44:54,929 INFO ]: Start accepts. Automaton has 9 states and 195 transitions. Word has length 7 [2018-06-25 06:44:54,929 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:54,929 INFO ]: Abstraction has 9 states and 195 transitions. [2018-06-25 06:44:54,929 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:44:54,929 INFO ]: Start isEmpty. Operand 9 states and 195 transitions. [2018-06-25 06:44:54,930 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:44:54,930 INFO ]: Found error trace [2018-06-25 06:44:54,930 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:44:54,930 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:54,930 INFO ]: Analyzing trace with hash -238946720, now seen corresponding path program 1 times [2018-06-25 06:44:54,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:54,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:54,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:54,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:54,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:54,949 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:55,074 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:44:55,075 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:44:55,075 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:44:55,075 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:44:55,075 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:44:55,075 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:55,075 INFO ]: Start difference. First operand 9 states and 195 transitions. Second operand 3 states. [2018-06-25 06:44:55,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:55,389 INFO ]: Finished difference Result 11 states and 195 transitions. [2018-06-25 06:44:55,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:44:55,390 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:44:55,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:55,390 INFO ]: With dead ends: 11 [2018-06-25 06:44:55,390 INFO ]: Without dead ends: 9 [2018-06-25 06:44:55,391 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:44:55,391 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:44:55,392 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 06:44:55,392 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:44:55,392 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2018-06-25 06:44:55,392 INFO ]: Start accepts. Automaton has 9 states and 187 transitions. Word has length 7 [2018-06-25 06:44:55,392 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:55,392 INFO ]: Abstraction has 9 states and 187 transitions. [2018-06-25 06:44:55,392 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:44:55,392 INFO ]: Start isEmpty. Operand 9 states and 187 transitions. [2018-06-25 06:44:55,393 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:44:55,393 INFO ]: Found error trace [2018-06-25 06:44:55,393 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:44:55,393 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:55,393 INFO ]: Analyzing trace with hash -1326259812, now seen corresponding path program 1 times [2018-06-25 06:44:55,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:55,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:55,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:55,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:55,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:55,421 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:56,048 WARN ]: Spent 529.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-25 06:44:56,092 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:56,092 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:56,092 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-25 06:44:56,098 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:56,156 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:56,159 INFO ]: Computing forward predicates... [2018-06-25 06:44:56,357 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:44:56,966 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:56,988 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:44:56,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:44:56,988 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:44:56,988 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:44:56,988 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:44:56,989 INFO ]: Start difference. First operand 9 states and 187 transitions. Second operand 8 states. [2018-06-25 06:44:58,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:58,402 INFO ]: Finished difference Result 16 states and 330 transitions. [2018-06-25 06:44:58,402 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 06:44:58,402 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:44:58,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:58,403 INFO ]: With dead ends: 16 [2018-06-25 06:44:58,403 INFO ]: Without dead ends: 16 [2018-06-25 06:44:58,404 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-25 06:44:58,404 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 06:44:58,405 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 06:44:58,405 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 06:44:58,406 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 326 transitions. [2018-06-25 06:44:58,406 INFO ]: Start accepts. Automaton has 12 states and 326 transitions. Word has length 7 [2018-06-25 06:44:58,406 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:58,406 INFO ]: Abstraction has 12 states and 326 transitions. [2018-06-25 06:44:58,406 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:44:58,406 INFO ]: Start isEmpty. Operand 12 states and 326 transitions. [2018-06-25 06:44:58,406 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:44:58,406 INFO ]: Found error trace [2018-06-25 06:44:58,406 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:44:58,406 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:58,406 INFO ]: Analyzing trace with hash -1783136936, now seen corresponding path program 2 times [2018-06-25 06:44:58,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:58,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:58,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:58,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:44:58,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:58,425 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:58,639 WARN ]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 06:44:58,878 WARN ]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-25 06:44:58,885 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:58,885 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:44:58,885 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-25 06:44:58,891 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 06:44:58,954 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 06:44:58,954 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:44:58,957 INFO ]: Computing forward predicates... [2018-06-25 06:44:59,041 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:44:59,075 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:44:59,075 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:44:59,075 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:44:59,075 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:44:59,075 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:44:59,076 INFO ]: Start difference. First operand 12 states and 326 transitions. Second operand 8 states. [2018-06-25 06:44:59,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:44:59,884 INFO ]: Finished difference Result 16 states and 330 transitions. [2018-06-25 06:44:59,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:44:59,886 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:44:59,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:44:59,886 INFO ]: With dead ends: 16 [2018-06-25 06:44:59,886 INFO ]: Without dead ends: 16 [2018-06-25 06:44:59,887 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 06:44:59,887 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 06:44:59,889 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 06:44:59,889 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 06:44:59,890 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 326 transitions. [2018-06-25 06:44:59,890 INFO ]: Start accepts. Automaton has 12 states and 326 transitions. Word has length 7 [2018-06-25 06:44:59,890 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:44:59,890 INFO ]: Abstraction has 12 states and 326 transitions. [2018-06-25 06:44:59,890 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:44:59,890 INFO ]: Start isEmpty. Operand 12 states and 326 transitions. [2018-06-25 06:44:59,890 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:44:59,890 INFO ]: Found error trace [2018-06-25 06:44:59,890 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:44:59,890 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:44:59,891 INFO ]: Analyzing trace with hash 135017142, now seen corresponding path program 1 times [2018-06-25 06:44:59,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:44:59,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:44:59,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:59,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 06:44:59,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:44:59,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:00,005 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:45:00,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:00,005 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-25 06:45:00,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:00,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:00,074 INFO ]: Computing forward predicates... [2018-06-25 06:45:00,087 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:45:00,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:00,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:45:00,111 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:45:00,111 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:45:00,111 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:45:00,111 INFO ]: Start difference. First operand 12 states and 326 transitions. Second operand 4 states. [2018-06-25 06:45:00,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:00,288 INFO ]: Finished difference Result 12 states and 166 transitions. [2018-06-25 06:45:00,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:45:00,291 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 06:45:00,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:00,291 INFO ]: With dead ends: 12 [2018-06-25 06:45:00,291 INFO ]: Without dead ends: 12 [2018-06-25 06:45:00,292 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:45:00,292 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 06:45:00,293 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 06:45:00,294 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 06:45:00,294 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2018-06-25 06:45:00,294 INFO ]: Start accepts. Automaton has 12 states and 166 transitions. Word has length 7 [2018-06-25 06:45:00,294 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:00,294 INFO ]: Abstraction has 12 states and 166 transitions. [2018-06-25 06:45:00,294 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:45:00,294 INFO ]: Start isEmpty. Operand 12 states and 166 transitions. [2018-06-25 06:45:00,295 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:00,295 INFO ]: Found error trace [2018-06-25 06:45:00,295 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:00,295 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:00,295 INFO ]: Analyzing trace with hash 135140150, now seen corresponding path program 1 times [2018-06-25 06:45:00,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:00,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:00,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:00,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:00,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:00,312 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:00,385 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:00,385 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:00,385 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-25 06:45:00,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:00,456 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:00,459 INFO ]: Computing forward predicates... [2018-06-25 06:45:00,479 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:00,500 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:00,500 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 06:45:00,500 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:45:00,500 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:45:00,500 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:45:00,500 INFO ]: Start difference. First operand 12 states and 166 transitions. Second operand 6 states. [2018-06-25 06:45:00,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:00,639 INFO ]: Finished difference Result 13 states and 55 transitions. [2018-06-25 06:45:00,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:45:00,639 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 06:45:00,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:00,639 INFO ]: With dead ends: 13 [2018-06-25 06:45:00,639 INFO ]: Without dead ends: 13 [2018-06-25 06:45:00,640 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:45:00,640 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 06:45:00,640 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 06:45:00,640 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:00,641 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2018-06-25 06:45:00,641 INFO ]: Start accepts. Automaton has 9 states and 51 transitions. Word has length 7 [2018-06-25 06:45:00,641 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:00,641 INFO ]: Abstraction has 9 states and 51 transitions. [2018-06-25 06:45:00,641 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:45:00,641 INFO ]: Start isEmpty. Operand 9 states and 51 transitions. [2018-06-25 06:45:00,641 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:00,641 INFO ]: Found error trace [2018-06-25 06:45:00,641 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:00,641 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:00,641 INFO ]: Analyzing trace with hash 47939436, now seen corresponding path program 1 times [2018-06-25 06:45:00,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:00,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:00,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:00,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:00,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:00,658 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:00,814 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:45:00,833 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:00,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:00,833 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-25 06:45:00,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:00,906 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:00,909 INFO ]: Computing forward predicates... [2018-06-25 06:45:01,005 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:01,275 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:01,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:01,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:45:01,297 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:45:01,297 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:45:01,297 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:45:01,297 INFO ]: Start difference. First operand 9 states and 51 transitions. Second operand 8 states. [2018-06-25 06:45:01,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:01,740 INFO ]: Finished difference Result 15 states and 57 transitions. [2018-06-25 06:45:01,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:45:01,740 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:45:01,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:01,740 INFO ]: With dead ends: 15 [2018-06-25 06:45:01,740 INFO ]: Without dead ends: 15 [2018-06-25 06:45:01,740 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 06:45:01,741 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 06:45:01,741 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-25 06:45:01,741 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:01,741 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2018-06-25 06:45:01,741 INFO ]: Start accepts. Automaton has 9 states and 51 transitions. Word has length 7 [2018-06-25 06:45:01,742 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:01,742 INFO ]: Abstraction has 9 states and 51 transitions. [2018-06-25 06:45:01,742 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:45:01,742 INFO ]: Start isEmpty. Operand 9 states and 51 transitions. [2018-06-25 06:45:01,742 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:45:01,742 INFO ]: Found error trace [2018-06-25 06:45:01,742 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:45:01,742 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:01,742 INFO ]: Analyzing trace with hash 1566473731, now seen corresponding path program 2 times [2018-06-25 06:45:01,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:01,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:01,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:01,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:45:01,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:01,761 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:02,102 WARN ]: Spent 273.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-06-25 06:45:02,120 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:02,123 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:02,123 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-25 06:45:02,129 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 06:45:02,191 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 06:45:02,191 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:02,194 INFO ]: Computing forward predicates... [2018-06-25 06:45:02,514 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:02,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:45:02,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:45:02,535 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:45:02,535 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:45:02,535 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:45:02,535 INFO ]: Start difference. First operand 9 states and 51 transitions. Second operand 8 states. [2018-06-25 06:45:02,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:45:02,754 INFO ]: Finished difference Result 15 states and 57 transitions. [2018-06-25 06:45:02,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:45:02,754 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:45:02,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:45:02,754 INFO ]: With dead ends: 15 [2018-06-25 06:45:02,754 INFO ]: Without dead ends: 15 [2018-06-25 06:45:02,755 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-25 06:45:02,755 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 06:45:02,755 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-25 06:45:02,755 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 06:45:02,756 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2018-06-25 06:45:02,756 INFO ]: Start accepts. Automaton has 9 states and 51 transitions. Word has length 7 [2018-06-25 06:45:02,756 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:45:02,756 INFO ]: Abstraction has 9 states and 51 transitions. [2018-06-25 06:45:02,756 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:45:02,756 INFO ]: Start isEmpty. Operand 9 states and 51 transitions. [2018-06-25 06:45:02,756 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 06:45:02,756 INFO ]: Found error trace [2018-06-25 06:45:02,756 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 06:45:02,756 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:45:02,756 INFO ]: Analyzing trace with hash -60872427, now seen corresponding path program 2 times [2018-06-25 06:45:02,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:45:02,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:45:02,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:02,757 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 06:45:02,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:45:02,785 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:03,030 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-06-25 06:45:03,171 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:45:03,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:45:03,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 06:45:03,187 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:45:03,267 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 06:45:03,267 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:45:03,273 INFO ]: Computing forward predicates... [2018-06-25 06:45:03,307 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,357 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,361 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,364 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 06:45:04,384 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,387 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:45:04,392 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:45:04,408 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,412 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 06:45:04,421 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 06:45:04,423 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:45:04,427 WARN ]: expecting exponential blowup for input size 9 [2018-06-25 06:45:04,429 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,432 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:04,433 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 06:45:04,442 WARN ]: expecting exponential blowup for input size 14 [2018-06-25 06:45:04,826 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,831 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,835 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:04,836 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:45:04,867 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:04,867 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:04,870 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 06:45:04,940 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,943 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 06:45:04,947 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:45:04,962 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 06:45:05,004 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:45:05,017 WARN ]: expecting exponential blowup for input size 13 [2018-06-25 06:45:05,083 WARN ]: Simplifying disjunction of 5184 conjuctions. This might take some time... Received shutdown request... [2018-06-25 06:45:06,847 INFO ]: Timeout while computing interpolants [2018-06-25 06:45:07,047 WARN ]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:45:07,047 WARN ]: Verification canceled [2018-06-25 06:45:07,050 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:45:07,051 WARN ]: Timeout [2018-06-25 06:45:07,051 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:45:07 BasicIcfg [2018-06-25 06:45:07,051 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:45:07,052 INFO ]: Toolchain (without parser) took 54852.11 ms. Allocated memory was 303.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 249.4 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-25 06:45:07,053 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:45:07,053 INFO ]: ChcToBoogie took 82.31 ms. Allocated memory is still 303.0 MB. Free memory was 249.4 MB in the beginning and 246.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:45:07,054 INFO ]: Boogie Preprocessor took 41.75 ms. Allocated memory is still 303.0 MB. Free memory was 246.4 MB in the beginning and 245.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-25 06:45:07,054 INFO ]: RCFGBuilder took 393.22 ms. Allocated memory is still 303.0 MB. Free memory was 245.4 MB in the beginning and 225.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 3.6 GB. [2018-06-25 06:45:07,054 INFO ]: BlockEncodingV2 took 17444.46 ms. Allocated memory was 303.0 MB in the beginning and 848.3 MB in the end (delta: 545.3 MB). Free memory was 225.4 MB in the beginning and 735.9 MB in the end (delta: -510.5 MB). Peak memory consumption was 473.4 MB. Max. memory is 3.6 GB. [2018-06-25 06:45:07,055 INFO ]: TraceAbstraction took 36881.03 ms. Allocated memory was 848.3 MB in the beginning and 1.6 GB in the end (delta: 792.7 MB). Free memory was 735.9 MB in the beginning and 1.3 GB in the end (delta: -579.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-25 06:45:07,067 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 1192 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 82.31 ms. Allocated memory is still 303.0 MB. Free memory was 249.4 MB in the beginning and 246.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.75 ms. Allocated memory is still 303.0 MB. Free memory was 246.4 MB in the beginning and 245.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 393.22 ms. Allocated memory is still 303.0 MB. Free memory was 245.4 MB in the beginning and 225.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 17444.46 ms. Allocated memory was 303.0 MB in the beginning and 848.3 MB in the end (delta: 545.3 MB). Free memory was 225.4 MB in the beginning and 735.9 MB in the end (delta: -510.5 MB). Peak memory consumption was 473.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 36881.03 ms. Allocated memory was 848.3 MB in the beginning and 1.6 GB in the end (delta: 792.7 MB). Free memory was 735.9 MB in the beginning and 1.3 GB in the end (delta: -579.3 MB). Peak memory consumption was 1.2 GB. 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 Cancelled while BasicCegarLoop was analyzing trace of length 9 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 5184 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 36.8s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 22.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8622 SDtfs, 372 SDslu, 1213 SDs, 0 SdLazy, 12399 SolverSat, 6111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=19, 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.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 53 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 58 NumberOfNonLiveVariables, 5971 ConjunctsInSsa, 366 ConjunctsInUnsatCore, 37 InterpolantComputations, 13 PerfectInterpolantSequences, 15/65 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/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-45-07-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-45-07-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-45-07-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/PRODUCER_CONSUMMER_luke_2_e7_1068_e8_1019.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-45-07-091.csv Completed graceful shutdown